Divide&classify: Fine-grained Classification For City-wide Visual Place Recognition

Abstract

Visual Place recognition is commonly addressed as an image retrieval problem. However, retrieval methods are impractical to scale to large datasets, densely sampled from city-wide maps, since their dimension impact negatively on the inference time. Using approximate nearest neighbour search for retrieval helps to mitigate this issue, at the cost of a performance drop. In this paper we investigate whether we can effectively approach this task as a classification problem, thus bypassing the need for a similarity search. We find that existing classification methods for coarse, planet-wide localization are not suitable for the fine-grained and city-wide setting. This is largely due to how the dataset is split into classes, because these methods are designed to handle a sparse distribution of photos and as such do not consider the visual aliasing problem across neighbouring classes that naturally arises in dense scenarios. Thus, we propose a partitioning scheme that enables a fast and accur

Stats

• citations9
• S2 citations—
• github stars0
• HF likes0
• heat score7.50
• arxiv keytrivigno2023divide

Related papers

• City-scale Visual Place Recognition With Deep Local Features Based On Multi-scale Ordered VLAD Pooling (2020)1.69
• Graph-based Non-linear Least Squares Optimization For Visual Place Recognition In Changing Environments (2020)7.16
• Are Local Features All You Need For Cross-domain Visual Place Recognition? (2023)13.80
• Optimal Transport Aggregation For Visual Place Recognition (2023)20.51
• LCD -- Line Clustering And Description For Place Recognition (2020)8.60
• 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
• Focus On Local: Finding Reliable Discriminative Regions For Visual Place Recognition (2025)10.70