Loop Closure Detection via Locality Preserving Matching With Global Consensus

• Published in: IEEE/CAA journal of automatica sinica Vol. 10; no. 2; pp. 411 - 426
• Main Authors: Ma, Jiayi, Zhang, Kaining, Jiang, Junjun
• Format: Journal Article
• Language: English
• Published: Piscataway Chinese Association of Automation (CAA) 01.02.2023; The Institute of Electrical and Electronics Engineers, Inc. (IEEE); Huazhong University of Science and Technology%Electronic Information School%Department of Mathematics, Huaqiao University
• Subjects: Algorithms; Cameras; Critical components; Dictionaries; Feature extraction; Feature matching; Liquid crystal displays; locality preserving matching; loop closure detection; Matching; Reliability; Repetitive structures; Robots; Simultaneous localization and mapping; SLAM; Task analysis; Visualization; Feature matching; loop closure detection; SLAM; locality preserving matching
• ISSN: 2329-9266; 2329-9274
• DOI: 10.1109/JAS.2022.105926

A critical component of visual simultaneous localization and mapping is loop closure detection (LCD), an operation judging whether a robot has come to a pre-visited area. Concretely, given a query image (i.e., the latest view observed by the robot), it proceeds by first exploring images with similar semantic information, followed by solving the relative relationship between candidate pairs in the 3D space. In this work, a novel appearance-based LCD system is proposed. Specifically, candidate frame selection is conducted via the combination of Super-features and aggregated selective match kernel (ASMK). We incorporate an incremental strategy into the vanilla ASMK to make it applied in the LCD task. It is demonstrated that this setting is memory-wise efficient and can achieve remarkable performance. To dig up consistent geometry between image pairs during loop closure verification, we propose a simple yet surprisingly effective feature matching algorithm, termed locality preserving matching with global consensus (LPM-GC). The major objective of LPM-GC is to retain the local neighborhood information of true feature correspondences between candidate pairs, where a global constraint is further designed to effectively remove false correspondences in challenging sceneries, e.g., containing numerous repetitive structures. Meanwhile, we derive a closed-form solution that enables our approach to provide reliable correspondences within only a few milliseconds. The performance of the proposed approach has been experimentally evaluated on ten publicly available and challenging datasets. Results show that our method can achieve better performance over the state-of-the-art in both feature matching and LCD tasks. We have released our code of LPM-GC at https://github.com/jiayi-ma/LPM-GC.