The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Appearance-Based Loop Closure Detection for Online Large-Scale and Long-Term Operation
Open accessAbstract
In appearance-based localization and mapping, loop-closure detection is the process used to determinate if the current observation comes from a previously visited location or a new one. As the size of the internal map increases, so does the time required to compare new observations with all stored locations, eventually limiting online processing. This paper presents an online loop-closure detection approach for large-scale and long-term operation. The approach is based on a memory management method, which limits the number of locations used for loop-closure detection so that the computation time remains under real-time constraints. The idea consists of keeping the most recent and frequently observed locations in a working memory (WM) that is used for loop-closure detection, and transferring the others into a long-term memory (LTM). When a match is found between the current location and one stored in WM, associated locations that are stored in LTM can be updated and remembered for additional loop-closure detections. Results demonstrate the approach's adaptability and scalability using ten standard datasets from other appearance-based loop-closure approaches, one custom dataset using real images taken over a 2-km loop of our university campus, and one custom dataset (7 h) using virtual images from the racing video game “Need for Speed: Most Wanted”.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
Speeded-Up Robust Features (SURF)
Bay, H., Ess, A., Tuytelaars, T., & Van Gool, L. (2008) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2007.09.014 · Cited by 13,557 · cited 1×
“For vision-based mapping, the bag-of-words [27] approach is commonly used [16], [18], [19], [28], [29] and has shown to perform online loop closure detection for paths of up to 1000 km [30].”
MethodThrun, S. (2002) · Communications of the ACM · doi:10.1145/504729.504754 · Cited by 7,994
Human Memory: A Proposed System and its Control Processes
Atkinson, R. C., & Shiffrin, R. M. (1968) · Psychology of Learning and Motivation · doi:10.1016/s0079-7421(08)60422-3 · Cited by 7,216
Video Google: a text retrieval approach to object matching in videos
Sivic, & Zisserman (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238663 · Cited by 6,367 · cited 2×
“As an exclusive or complementary alternative, appearance-based loop closure detection approaches [15]–[19] generally detect a loop closure by comparing a new location with all previously visited locations, independently of the estimated position of the robot.”
BackgroundMonoSLAM: Real-time single camera SLAM
Davison, A. J., Reid, I. D., Molton, N. D., & Stasse, O. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1049 · Cited by 3,959 · cited 2×
“Such approaches can be processed under real-time constraints at 30 Hz [14] as long as the estimated position is valid, which can-”
BackgroundScalable Recognition with a Vocabulary Tree
Nister, D., & Stewenius, H. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (CVPR'06) · doi:10.1109/cvpr.2006.264 · Cited by 3,579
Human memory : theory and practice
Baddeley, A. (1990) · Cited by 3,045
Object retrieval with large vocabularies and fast spatial matching
Philbin, J., Chum, O., Isard, M., Sivic, J., & Zisserman, A. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383172 · Cited by 2,929
FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION
(2009) · Proceedings of the Fourth International Conference on Computer Vision Theory and Applications · doi:10.5220/0001787803310340 · Cited by 2,640
Cited by
Labbé, M., & Michaud, F. (2019) · Journal of Field Robotics · doi:10.1002/rob.21831 · Cited by 989
Self-citationOnline global loop closure detection for large-scale multi-session graph-based SLAM
Labbe, M., & Michaud, F. (2014) · 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2014.6942926 · Cited by 373
Self-citationTsintotas, K. A., Bampis, L., & Gasteratos, A. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3175656 · Cited by 175
“Aiming to prevent the system from detecting false-positives, these locations are rejected based on a sliding window defined either by a timing constant [134], [137], [142], [176], [255] or environmental semantic changes [50], [97], [128], [144], [148], [150].”
BackgroundMethodInfluentialiBoW-LCD: An Appearance-Based Loop-Closure Detection Approach Using Incremental Bags of Binary Words
Garcia-Fidalgo, E., & Ortiz, A. (2018) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2018.2849609 · Cited by 167
Edge-SLAM: edge-assisted visual simultaneous localization and mapping
Ben Ali, A. J., Hashemifar, Z. S., & Dantu, K. (2020) · Proceedings of the 18th International Conference on Mobile Systems, Applications, and Services · doi:10.1145/3386901.3389033 · Cited by 46
Metadata
- Authors
- Labbe, M., & Michaud, F.
- Venue
- IEEE Transactions on Robotics
- Published
- 2013-06
- Volume
- 29
- Issue
- 3
- Pages
- 734-745
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W2115499947
- Cited by
- 372
- References
- 49
- FWCI
- 22.51
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.