Towards Test-time Efficient Visual Place Recognition Via Asymmetric Query Processing

Abstract

Visual Place Recognition (VPR) has advanced significantly with high-capacity foundation models like DINOv2, achieving remarkable performance. Nonetheless, their substantial computational cost makes deployment on resource-constrained devices impractical. In this paper, we introduce an efficient asymmetric VPR framework that incorporates a high-capacity gallery model for offline feature extraction with a lightweight query network for online processing. A key challenge in this setting is ensuring compatibility between these heterogeneous networks, which conventional approaches address through computationally expensive k-NN-based compatible training. To overcome this, we propose a geographical memory bank that structures gallery features using geolocation metadata inherent in VPR databases, eliminating the need for exhaustive k-NN computations. Additionally, we introduce an implicit embedding augmentation technique that enhances the query network to model feature variations despite its lim

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keykim2025towards

Related papers

• Structured Pruning For Efficient Visual Place Recognition (2024)2.26
• Collaborative Visual Place Recognition Through Federated Learning (2024)2.26
• Multires-netvlad: Augmenting Place Recognition Training With Low-resolution Imagery (2022)16.01
• Evaluation Of Visual Place Recognition Methods For Image Pair Retrieval In 3D Vision And Robotics (2026)0.00
• Optimal Transport Aggregation For Visual Place Recognition (2023)20.51
• Attention-aware Age-agnostic Visual Place Recognition (2019)8.82
• SAGE: Spatial-visual Adaptive Graph Exploration For Efficient Visual Place Recognition (2025)2.16
• Query-based Adaptive Aggregation For Multi-dataset Joint Training Toward Universal Visual Place Recognition (2025)0.00