FAB-MAP: Probabilistic Localization and Mapping in the Space of Appearance
The DOI matches its Crossref record; 54 of the 57 references it cites were found in a registry or an index.
Abstract
This paper describes a probabilistic approach to the problem of recognizing places based on their appearance. The system we present is not limited to localization, but can determine that a new observation comes from a previously unseen place, and so augment its map. Effectively this is a SLAM system in the space of appearance. Our probabilistic approach allows us to explicitly account for perceptual aliasing in the environment—identical but indistinctive observations receive a low probability of having come from the same place. We achieve this by learning a generative model of place appearance. By partitioning the learning problem into two parts, new place models can be learned online from only a single observation of a place. The algorithm complexity is linear in the number of places in the map, and is particularly suitable for online loop closure detection in mobile robotics.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Proceedings of IEEE Conference on Computer Vision and Pattern Recognition
(1993) · doi:10.1109/cvpr.1993 · Cited by 17,667
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Object recognition from local scale-invariant features
Lowe, D. G. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790410 · Cited by 16,472 · cited 2×
“Local feature schemes consist of a region-of-interest detector combined with a descriptor of the local region, SIFT (Lowe 1999) being a popular example.”
BackgroundSURF: Speeded Up Robust Features
Bay, H., Tuytelaars, T., & Van Gool, L. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744023_32 · Cited by 14,955
Advances in neural information processing systems 7
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90463-0 · Cited by 14,281
(1999) · Cited by 12,854
Grossman, P. (2009) · Discrete Mathematics for Computing · doi:10.1007/978-0-230-37405-8_1 · Cited by 8,834
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 4×
“Finally, we map regions of descriptor space to visual words as suggested by Sivic and Zisserman (2003).”
MethodInfluentialGumbel, E. J. (1958) · Columbia University Press eBooks · doi:10.7312/gumb92958 · Cited by 5,567
Discrete Multivariate Analysis: Theory and Practice.
Beniger, J. R., Bishop, Y. M. M., Feinberg, S. E., Holland, P. W., Light, R. J., & Mosteller, F. (1975) · Contemporary Sociology · doi:10.2307/2063625 · Cited by 5,108
An Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999) · Machine Learning · doi:10.1023/a:1007665907178 · Cited by 3,791 · cited 2×
“The first is a mean field approximation (Jordan et al. 1999):”
BackgroundProceedings. 1985 IEEE International Conference on Robotics and Automation
(1985) · doi:10.1109/robot.1985 · Cited by 3,673
Scalable 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 · cited 3×
“KEY WORDS—place recognition, topological SLAM, appearance based navigation”
BackgroundMethodInfluentialDiscrete Multivariate Analysis: Theory and Practice.
Plackett, R. L., Bishop, Y. M. M., Fienberg, S. E., & Holland, P. W. (1976) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344845 · Cited by 1,729 · cited 1×
“To mitigate potential problems due to limited training data, we use the pseudo-Bayesian p estimator described in Bishop et al. (1977), rather than the maximum likelihood estimator.”
MethodApproximating discrete probability distributions with dependence trees
Chow, C., & Liu, C. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054142 · Cited by 1,720 · cited 1×
“Chow and Liu (1968) described a polynomial time algorithm to select the best such distribution, which we elaborate on below.”
BackgroundRecognizing Objects in Range Data Using Regional Point Descriptors
Frome, A., Huber, D., Kolluri, R., Bülow, T., & Malik, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24672-5_18 · Cited by 885 · cited 2×
“For example, laser or sonar data could be represented using quantized versions of the features proposed in Johnson (1997) Frome et al. (2004) Mozos et al. (2005).”
MethodContext-based vision system for place and object recognition
Torralba, Murphy, Freeman, & Rubin (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238354 · Cited by 867 · cited 2×
“More recently Torralba et al. (2003) represent places by a set of texture features, and describe a system where localization is cast as estimating the state of a hidden Markov model.”
BackgroundCity-Scale Location Recognition
Schindler, G., Brown, M., & Szeliski, R. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383150 · Cited by 626 · cited 3×
“We have not focused on this bag-of-words generation stage of the system—more sophisticated approaches exist (Nister and Stewenius 2006 Schindler et al. 2007) and there are probably gains to be realized here.”
BackgroundIncremental mapping of large cyclic environments
Gutmann, J.-S., & Konolige, K. (2003) · Proceedings 1999 IEEE International Symposium on Computational Intelligence in Robotics and Automation. CIRA'99 (Cat. No.99EX375) · doi:10.1109/cira.1999.810068 · Cited by 568 · cited 3×
“We demonstrate our system by detecting loop closures over a 2 km path length in an initially unknown outdoor environment, where the system detects a large fraction of the loop closures without false positives.”
BackgroundProceedings, 1989 International Conference on Robotics and Automation
(1989) · doi:10.1109/robot.1989 · Cited by 531
Appearance-based place recognition for topological localization
Ulrich, I., & Nourbakhsh, I. (2002) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844734 · Cited by 512 · cited 2×
“Early examples include representing appearance as a set of image histograms (Ulrich and Nourbakhsh 2000), and as ordered sequences of edge and color features (Lamon et al. 2001).”
BackgroundVision-based global localization and mapping for mobile robots
Se, S., Lowe, D. G., & Little, J. J. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2004.839228 · Cited by 482 · cited 2×
“This problem has recently received attention in the context of large-scale global localization (Schindler et al. 2007) and loop closure detection in mobile robotics (Ho and Newman 2007).”
BackgroundMethod2006 IEEE International Conference on Robotics and Automation
(2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2005.851305 · Cited by 427
Outdoor SLAM using visual appearance and laser ranging
Newman, P., Cole, D., & Ho, K. (2006) · Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006. · doi:10.1109/robot.2006.1641869 · Cited by 316 · cited 3×
“A series of papers by Ho and Newman (2005b,a) Newman and Ho (2005) Newman et al. (2006) advance similarity-matrix-based techniques by considering the problem of perceptual aliasing.”
BackgroundMethodSelf-citationA visual bag of words method for interactive qualitative localization and mapping
Filliat, D. (2007) · Proceedings 2007 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2007.364080 · Cited by 230 · cited 1×
“Filliat (2007) described a system where the visual vocabulary is learned online.”
BackgroundSupervised Learning of Places from Range Data using AdaBoost
Mozos, O. M., Stachniss, C., & Burgard, W. (2006) · Proceedings of the 2005 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2005.1570363 · Cited by 222 · cited 2×
“For example, laser or sonar data could be represented using quantized versions of the features proposed in Johnson (1997) Frome et al. (2004) Mozos et al. (2005).”
MethodWolf, J., Burgard, W., & Burkhardt, H. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2004.835453 · Cited by 219 · cited 2×
“More recently, Wolf et al. (2005) used an image retrieval system based on invariant features as the basis of a Monte Carlo localization scheme.”
BackgroundMethodSLAM-Loop Closing with Visually Salient Features
Newman, P., & Ho, K. (2006) · Proceedings of the 2005 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2005.1570189 · Cited by 215 · cited 1×
“A series of papers by Ho and Newman (2005b,a) Newman and Ho (2005) Newman et al. (2006) advance similarity-matrix-based techniques by considering the problem of perceptual aliasing.”
BackgroundSelf-citationDetecting Loop Closure with Scene Sequences
Ho, K. L., & Newman, P. (2007) · International Journal of Computer Vision · doi:10.1007/s11263-006-0020-1 · Cited by 213 · cited 6×
“Levin and Szeliski (2004) describe such a method that uses a cascade of similarity functions based on global color histograms, image moments, and epipolar geometry.”
BackgroundMethodInfluentialSelf-citationContent-based query of image databases: inspirations from text retrieval
Squire, D. M., Müller, W., Müller, H., & Pun, T. (2000) · Pattern Recognition Letters · doi:10.1016/s0167-8655(00)00081-7 · Cited by 191
Probabilistic Appearance Based Navigation and Loop Closing
Cummins, M., & Newman, P. (2007) · Proceedings 2007 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2007.363622 · Cited by 167 · cited 2×
“The core of our approach we have previously described in Cummins and Newman (2007) here we expand on that presentation and present a detailed evaluation of the system’s performance.”
MethodSelf-citationA probabilistic model for appearance-based robot localization
Kröse, B., Vlassis, N. A., Bunschoten, R., & Motomura, Y. (2001) · Image and Vision Computing · doi:10.1016/s0262-8856(00)00086-x · Cited by 148 · cited 4×
“We demonstrate our system by detecting loop closures over a 2 km path length in an initially unknown outdoor environment, where the system detects a large fraction of the loop closures without false positives.”
BackgroundMethodInfluentialBach, F., & Jordan, M. I. (2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.003.0078 · Cited by 128 · cited 2×
“It was shown by Srebro (2001) that the problem of determining the optimal thin junction tree is NP-hard, though there are several methods to find a good approximate solution (for example, Bach and Jordan (2002)).”
BackgroundMethodMaximum likelihood bounded tree-width Markov networks
Srebro, N. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00360-0 · Cited by 105 · cited 1×
“It was shown by Srebro (2001) that the problem of determining the optimal thin junction tree is NP-hard, though there are several methods to find a good approximate solution (for example, Bach and Jordan (2002)).”
MethodHierarchical map building using visual landmarks and geometric constraints
Živković, Z., Bakker, B., & Kröse, B. (2005) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2005.1544951 · Cited by 95 · cited 2×
“We demonstrate our system by detecting loop closures over a 2 km path length in an initially unknown outdoor environment, where the system detects a large fraction of the loop closures without false positives.”
BackgroundVisual odometry and map correlation
Levin, A., & Szeliski, R. (2004) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2004.1315088 · Cited by 89
Mobile robot localization from learned landmarks
Sim, R., & Dudek, G. (2002) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.1998.727439 · Cited by 89 · cited 1×
“An early example of the approach was described by Sim and Dudek (1998).”
MethodDeriving and matching image fingerprint sequences for mobile robot localization
Lamon, P., Nourbakhsh, I., Jensen, B., & Siegwart, R. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2001.932841 · Cited by 75 · cited 1×
“Early examples include representing appearance as a set of image histograms (Ulrich and Nourbakhsh 2000), and as ordered sequences of edge and color features (Lamon et al. 2001).”
BackgroundProbabilistic location recognition using reduced feature set
Li, F., & Košecká, J. (2006) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2006.1642222 · Cited by 65 · cited 1×
“The issue of selecting the most salient local features for localization was considered in Li and Kosecka (2006).”
BackgroundAn Accelerated Chow and Liu Algorithm: Fitting Tree Distributions to High-Dimensional Sparse Data
Meilă, M. (1999) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 51
Engineering an External Memory Minimum Spanning Tree Algorithm
Dementiev, R., Sanders, P., Schultes, D., & Sibeyn, J. F. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/1-4020-8141-3_17 · Cited by 47 · cited 1×
“To deal with this, we use a semi-external spanning tree algorithm (Dementiev et al. 2004).”
MethodVision-based Global Localization Using a Visual Vocabulary
Wang, J., Cipolla, R., & Zha, H. (2006) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2005.1570770 · Cited by 37 · cited 2×
“We demonstrate our system by detecting loop closures over a 2 km path length in an initially unknown outdoor environment, where the system detects a large fraction of the loop closures without false positives.”
BackgroundMethod(2000) · The MIT Press eBooks · doi:10.7551/mitpress/2028.003.0016 · Cited by 37 · cited 1×
“Goedemé (2006) described an approach to this issue using Dempster–Shafer theory, using sequences of observations to confirm or reject putative loop closures.”
MethodSubjective Localization with Action Respecting Embedding
Bowling, M., Wilkinson, D. F., Ghodsi, A., & Milstein, A. (2007) · Springer eBooks · doi:10.1007/978-3-540-48113-3_18 · Cited by 35 · cited 2×
“Our system effectively learns a model of these common objects (without supervision, see Figure 5), which allows us to improve inference by reasoning about which sets of features are likely to appear or disappear together (for example, see Figure 12).”
MethodA Rao-Blackwellized particle filter for topological mapping
Ranganathan, A., & Dellaert, F. (2006) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2006.1641809 · Cited by 35 · cited 3×
“Clearly there is room for improvement here, for example by maintaining a PDF over topologies using a particle filter, as described by Ranganathan and Dellaert (2006).”
BackgroundMethodVisual localization and loop-back detection with a high resolution omnidirectional camera
Silpa-Anan, C., & Hartley, R. I. (2005) · ANU Open Research (Australian National University) · Cited by 28
Localisation using an image-map
Silpa-Anan, C., & Hartley, R. I. (2004) · ANU Open Research (Australian National University) · Cited by 24
Chen, C., & Wang, H. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906068375 · Cited by 16 · cited 3×
“Chow and Liu (1968) described a polynomial time algorithm to select the best such distribution, which we elaborate on below. More generally, we could constrain Q Z such that each variable is conditioned on at most n other variables. This structure is known as a thin junction tree. It was shown by Srebro (2001) that th…”
BackgroundMethodProceedings of International Conference on Computational Intelligence: ICCI 2023
Tiwari, R., Saraswat, M., & Pavone, M. (2024) · Algorithms for intelligent systems · doi:10.1007/978-981-97-3526-6 · Cited by 14
Bowling, M., Wilkinson, D. F., & Ghodsi, A. (2006) · National Conference on Artificial Intelligence · Cited by 5
Integration of Multiple Sensors using Binary Features in a Bernoulli Mixture Model
Ferreira, F., Santos, V. M. F., & Dias, J. M. M. (2006) · IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems (MFI) · doi:10.1109/mfi.2006.265672 · Cited by 4 · cited 2×
“We demonstrate our system by detecting loop closures over a 2 km path length in an initially unknown outdoor environment, where the system detects a large fraction of the loop closures without false positives.”
BackgroundMethod
Research works printed but not linked: 27
- Bay, H., 2006, Proceedings of the 9th European Conference on Computer Vision, Graz, Austria, 13, 404
- Bowling, M., Twenty-First National Conference on Artificial Intelligence
- Bowling, M., Proceedings of the International Symposium of Robotics Research
- Dementiev, R., Proceedings 3rd International Conference on Theoretical Computer Science
- Ferreira, F., Proceedings IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems
- Gutmann, J., Proceedings of the IEEE International Symposium on Computational Intelligence in Robotics and Automation (CIRA)
- Ho, K., Proceedings of the European Conference on Mobile Robotics
- Ho, K., Proceedings of the International Conference on Computational Intelligence
- Johnson, A., 1997, Spin-Images: a representation for 3-D surface matching
- Li, F., IEEE International Conference on Robotics and Automation
- Lowe, D.G., Proceedings of the 7th International Conference on Computer Vision
- Meila, M., ICML '99: Proceedings of the Sixteenth International Conference on Machine Learning
- Meila2-Predoviciu, M., 1999, Learning with mixtures of trees
- Mozos, O., Proceedings of the IEEE International Conference on Robotics and Automation
- Newman, P., Proceedings of the IEEE International Conference on Robotics and Automation
- Newman, P.M., Proceedings of the IEEE International Conference on Robotics and Automation (ICRA)
- Nister, D., 2006, Proceedings of the Conference on Computer Vision and Pattern Recognition, 2, 2161
- Ramos, F.T., Proceedings of the IJCAI Workshop on Reasoning with Uncertainty in Robotics
- Ranganathan, A., Proceedings of International Conference on Robotics and Automation
- Schindler, G., Proceedings IEEE Conference on Computer Vision and Pattern Recognition
- Silpa-Anan, C., Proceedings of the Australian Conference on Robotics and Automation
- Silpa-Anan, C., Proceedings of the Workshop on Omnidirectional Vision
- Sim, R., Proceedings of the IEEE International Conference on Intelligent Robots and Systems
- Sivic, J., Proceedings of the International Conference on Computer Vision
- Srebro, N., Proceedings of the 17th Annual Conference on Uncertainty in Artificial Intelligence (UAI-01)
- Torralba, A., ICCV '03: Proceedings of the Ninth IEEE International Conference on Computer Vision
- Wang, J., Proceedings of the IEEE International Conference on Robotics and Automation
Cited by
Variational Inference: A Review for Statisticians
Blei, D. M., Kucukelbir, A., & McAuliffe, J. D. (2017) · Journal of the American Statistical Association · doi:10.1080/01621459.2017.1285773 · Cited by 3,811
“…Wang and Mori 2009), image denoising (Likas and Galatsanos 2004), tracking (Vermaak, Lawrence, and Pérez 2003; Yu and Wu 2005), place recognition and mapping for robotics (Cummins and Newman 2008; Ramos et al. 2012), and image segmentation with Bayesian nonparametrics (Sudderth and Jordan 2009).”
BackgroundPast, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I., & Leonard, J. J. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2624754 · Cited by 3,596
“Short-term data association is responsible for associating corresponding features in consecutive sensor measurements; for instance, short-term data association would track the fact that 2 pixel measurements in consecutive frames are picturing the same 3D point.”
NetVLAD: CNN Architecture for Weakly Supervised Place Recognition
Arandjelovic, R., Gronat, P., Torii, A., Pajdla, T., & Sivic, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.572 · Cited by 2,584
“Visual place recognition has received a significant amount of attention in the past years both in computer vision [5, 10, 11, 24, 35, 62, 63, 64, 65, 79, 80] and robotics communities [16, 17, 44, 46, 74] motivated by, e.”
BackgroundPast, present, and future of simultaneous localization and mapping: Toward the robust-perception age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I. D., & Leonard, J. J. (2016) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-138892 · Cited by 3,048
PoseNet: A Convolutional Network for Real-Time 6-DOF Camera Relocalization
Kendall, A., Grimes, M., & Cipolla, R. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.336 · Cited by 2,489
“Appearance-based relocalization has had success [4, 23] in coarsely locating the camera among a limited, discretized set of place labels, leaving the pose estimation to a separate system.”
BackgroundMethod
Metadata
- Authors
- Cummins, M., & Newman, P.
- Affiliations
- University of Oxford (GB)
- Corresponding author
- Cummins, Mark
- Newman, Paul
- ORCID
- Newman, Paul
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2008-06
- Volume
- 27
- Issue
- 6
- Pages
- 647-665
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2144824356
- Cited by
- 1,472
- References
- 57
- Citations by year
- 2026: 28 · 2025: 43 · 2024: 60 · 2023: 59 · 2022: 119 · 2021: 122 · 2020: 103 · 2019: 117 · 2018: 105 · 2017: 127 · 2016: 90 · 2015: 103 · 2014: 72 · 2013: 83 · 2012: 71
- FWCI
- 116.69
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- journals.sagepub.com/page/policies/text-and-data-mining-license (tdm)
- Locations
- The International Journal of Robotics Research (publishedVersion)
- Funders
- Engineering and Physical Sciences Research Council
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotics and Sensor-Based Localization
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image and Video Retrieval Techniques
- Keywords
- place recognition, perceptual aliasing, loop closure detection, mobile robots
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.