Application of Locality Sensitive Hashing to realtime loop closure detection

In this work we present a new approach for detecting loop closures in a real-time online setting. The Loop Closure Detection problem is important in visual SLAM applications and different approaches exist to deal with this problem. Most of these approaches are based on the Bag-of-Words approach, and assume a fixed visual vocabulary can work in different types of environments. However BOW is known to introduce perceptual aliasing. By using Locality Sensitive Hashing (LSH) we are able to compute image similarity and detect loop closures by using visual features directly without vector quantization as in BOW and also LSH does not require a prior visual vocabulary. We show the effectiveness of our approach empirically by comparing it to the Bag of Words (BOW) approach which is the dominant method of selecting candidate loop closing images. Our method is fast enough for realtime applications and its accuracy is significantly better than the BOW approach.

[1]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[2]  Andrew Zisserman,et al.  Video Google: a text retrieval approach to object matching in videos , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[3]  Nicole Immorlica,et al.  Locality-sensitive hashing scheme based on p-stable distributions , 2004, SCG '04.

[4]  G LoweDavid,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004 .

[5]  Paul Newman,et al.  Outdoor SLAM using visual appearance and laser ranging , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[6]  David Nistér,et al.  Scalable Recognition with a Vocabulary Tree , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[7]  Richard Szeliski,et al.  City-Scale Location Recognition , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[8]  Andrew Zisserman,et al.  Near Duplicate Image Detection: min-Hash and tf-idf Weighting , 2008, BMVC.

[9]  Jean-Arcady Meyer,et al.  Real-time visual loop-closure detection , 2008, 2008 IEEE International Conference on Robotics and Automation.

[10]  Jean-Arcady Meyer,et al.  Incremental vision-based topological SLAM , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[11]  Paul Newman,et al.  FAB-MAP: Probabilistic Localization and Mapping in the Space of Appearance , 2008, Int. J. Robotics Res..

[12]  Jean-Arcady Meyer,et al.  Visual topological SLAM and global localization , 2009, 2009 IEEE International Conference on Robotics and Automation.

[13]  O. Chum,et al.  Geometric min-Hashing: Finding a (thick) needle in a haystack , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[14]  Jiri Matas,et al.  Geometric min-Hashing: Finding a (thick) needle in a haystack , 2009, CVPR.

[15]  Paul Newman,et al.  Highly scalable appearance-only SLAM - FAB-MAP 2.0 , 2009, Robotics: Science and Systems.

[16]  Bo Li,et al.  Keyframe detection for appearance-based visual SLAM , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[17]  Andrea Vedaldi,et al.  Vlfeat: an open and portable library of computer vision algorithms , 2010, ACM Multimedia.

[18]  Hong Zhang,et al.  BoRF: Loop-closure detection with scale invariant visual features , 2011, 2011 IEEE International Conference on Robotics and Automation.

[19]  Piotr Indyk,et al.  Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality , 2012, Theory Comput..