Skip to main content

Loop Closure Detection Using Local Invariant Features and Randomized KD-Trees

  • Chapter
  • First Online:
Methods for Appearance-based Loop Closure Detection

Part of the book series: Springer Tracts in Advanced Robotics ((STAR,volume 122))

  • 605 Accesses

Abstract

This chapter introduces an appearance-based approach for topological mapping and localization named FEATMap (Feature-based Mapping). FEATMap relies on a loop closure detection scheme which makes use of local invariant features to describe images. These features are indexed using a set of randomized kd-trees, which permit seeking for matchings between the current and previous images to detect loop closures in a straightforward way. A discrete Bayes filter is added to the solution to obtain loop candidates while ensuring the temporal coherency between consecutive predictions. Finally, FEATMap comprises a method for refining the resulting maps as they are obtained, removing spurious nodes in accordance to the visual information that they contain.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    \(P(A \mid B,\,C)\,P(B \mid C) = \frac{P(A \cap B \cap C)}{P(B \cap C)}\,\frac{P(B \cap C)}{P(C)} = \frac{P(A \cap B \cap C)}{P(A \cap C)}\,\frac{P(A \cap C)}{P(C)} = P(B \mid A,\,C)\,P(A \mid C)\).

References

  1. Sivic, J., Zisserman, A.: Video Google: a text retrieval approach to object matching in videos. In: IEEE International Conference on Computer Vision, pp. 1470–1477 (2003)

    Google Scholar 

  2. Zhang, H.: BoRF: loop-closure detection with scale invariant visual features. In: IEEE International Conference on Robotics and Automation, pp. 3125–3130 (2011)

    Google Scholar 

  3. Angeli, A., Doncieux, S., Meyer, J.A., Filliat, D.: Real-time visual loop-closure detection. In: IEEE International Conference on Robotics and Automation, pp. 1842–1847 (2008)

    Google Scholar 

  4. Booij, O., Terwijn, B., Zivkovic, Z., Krose, B.: Navigation using an appearance based topological map. In: IEEE International Conference on Robotics and Automation, pp. 3927–3932 (2007)

    Google Scholar 

  5. Calonder, M., Lepetit, V., Strecha, C., Fua, P.: BRIEF: binary robust independent elementary features. In: European Conference on Computer Vision, Lecture Notes in Computer Science, vol. 6314, pp. 778–792 (2010)

    Google Scholar 

  6. Leutenegger, S., Chli, M., Siegwart, R.: BRISK: binary robust invariant scalable keypoints. In: IEEE International Conference on Computer Vision, pp. 2548–2555 (2011)

    Google Scholar 

  7. Rublee, E., Rabaud, V., Konolige, K., Bradski, G.: ORB: an efficient alternative to SIFT or SURF. IEEE Int. Conf. Comput. Vis. 95, 2564–2571 (2011)

    Google Scholar 

  8. Alahi, A., Ortiz, R., Vandergheynst, P.: FREAK : fast retina keypoint. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 510–517 (2012)

    Google Scholar 

  9. Yang, X., Cheng, K.T.: Local difference binary for ultrafast and distinctive feature description. IEEE Trans. Pattern Anal. Mach. Intell. 36(1), 188–94 (2014)

    Article  Google Scholar 

  10. Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vision 60(2), 91–110 (2004)

    Article  Google Scholar 

  11. Bay, H., Tuytelaars, T., Van Gool, L.: SURF: speeded up robust features. In: European Conference on Computer Vision, Lecture Notes in Computer Science, vol. 3951, pp. 404–417 (2006)

    Google Scholar 

  12. Zhang, H., Li, B., Yang, D.: Keyframe detection for appearance-based visual SLAM. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 2071–2076 (2010)

    Google Scholar 

  13. Angeli, A., Filliat, D., Doncieux, S., Meyer, J.A.: A fast and incremental method for loop-closure detection using bags of visual words. IEEE Trans. Robot. 24(5), 1027–1037 (2008)

    Article  Google Scholar 

  14. Cummins, M., Newman, P.: FAB-MAP: probabilistic localization and mapping in the space of appearance. Int. J. Rob. Res. 27(6), 647–665 (2008)

    Article  Google Scholar 

  15. Sparck Jones, K.: A statistical interpretation of term specificity and its application in retrieval. J. Doc. 28, 11–21 (1972)

    Article  Google Scholar 

  16. Cummins, M., Newman, P.: Appearance-only SLAM at large scale with FAB-MAP 2.0. Int. J. Rob. Res. 30(9), 1100–1123 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alberto Ortiz .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Garcia-Fidalgo, E., Ortiz, A. (2018). Loop Closure Detection Using Local Invariant Features and Randomized KD-Trees. In: Methods for Appearance-based Loop Closure Detection. Springer Tracts in Advanced Robotics, vol 122. Springer, Cham. https://doi.org/10.1007/978-3-319-75993-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75993-7_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-75992-0

  • Online ISBN: 978-3-319-75993-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics