Visual Place Recognition With Probabilistic Vertex Voting
2016 · Mathias Gehrig, Elena Stumm, Timo Hinzmann, et al.
Abstract
We propose a novel scoring concept for visual place recognition based on nearest neighbor descriptor voting and demonstrate how the algorithm naturally emerges from the problem formulation. Based on the observation that the number of votes for matching places can be evaluated using a binomial distribution model, loop closures can be detected with high precision. By casting the problem into a probabilistic framework, we not only remove the need for commonly employed heuristic parameters but also provide a powerful score to classify matching and non-matching places. We present methods for both a 2D-2D pose-graph vertex matching and a 2D-3D landmark matching based on the above scoring. The approach maintains accuracy while being efficient enough for online application through the use of compact (low dimensional) descriptors and fast nearest neighbor retrieval techniques. The proposed methods are evaluated on several challenging datasets in varied environments, showing state-of-the-art res
Authors
(none)
Tags
Stats
Related papers
- Graph-based Non-linear Least Squares Optimization For Visual Place Recognition In Changing Environments (2020)7.16
- Eigenplaces: Training Viewpoint Robust Models For Visual Place Recognition (2023)15.46
- Fast, Compact And Highly Scalable Visual Place Recognition Through Sequence-based Matching Of Overloaded Representations (2020)9.41
- Divide&classify: Fine-grained Classification For City-wide Visual Place Recognition (2023)7.50
- Spatio-semantic Convnet-based Visual Place Recognition (2019)10.21
- Embodiedplace: Learning Mixture-of-features With Embodied Constraints For Visual Place Recognition (2025)0.00
- Probabilistic Visual Place Recognition For Hierarchical Localization (2021)11.08
- Close, But Not There: Boosting Geographic Distance Sensitivity In Visual Place Recognition (2024)10.40