Graph-based Non-linear Least Squares Optimization For Visual Place Recognition In Changing Environments

Abstract

Visual place recognition is an important subproblem of mobile robot localization. Since it is a special case of image retrieval, the basic source of information is the pairwise similarity of image descriptors. However, the embedding of the image retrieval problem in this robotic task provides additional structure that can be exploited, e.g. spatio-temporal consistency. Several algorithms exist to exploit this structure, e.g., sequence processing approaches or descriptor standardization approaches for changing environments. In this paper, we propose a graph-based framework to systematically exploit different types of additional structure and information. The graphical model is used to formulate a non-linear least squares problem that can be optimized with standard tools. Beyond sequences and standardization, we propose the usage of intra-set similarities within the database and/or the query image set as additional source of information. If available, our approach also allows to seamless

Stats

• citations8
• S2 citations—
• github stars0
• HF likes0
• heat score7.16
• arxiv keyschubert2020graph

Related papers

• Probabilistic Visual Place Recognition For Hierarchical Localization (2021)11.08
• Regressing Transformers For Data-efficient Visual Place Recognition (2024)3.58
• Fast, Compact And Highly Scalable Visual Place Recognition Through Sequence-based Matching Of Overloaded Representations (2020)9.41
• Eigenplaces: Training Viewpoint Robust Models For Visual Place Recognition (2023)15.46
• Are Local Features All You Need For Cross-domain Visual Place Recognition? (2023)13.80
• Visual Place Recognition With Probabilistic Vertex Voting (2016)11.85
• SAGE: Spatial-visual Adaptive Graph Exploration For Efficient Visual Place Recognition (2025)2.16
• Structvpr++: Distill Structural And Semantic Knowledge With Weighting Samples For Visual Place Recognition (2025)3.58