Organizations: Key Laboratory of Spectral Imaging Technology CAS, Xi’an Institute of Optics and Precision Mechanics, Chinese Academy of Sciences, Xi’an, 710119, China · University of Chinese Academy of Sciences, Beijing, 100049, China
Frozen visual foundation models provide transferable features for visual place recognition, but fixed aggregation can suppress useful distinctions in new environments. We introduce TFA, a reliability-guided, training-free aggregation method requiring neither place labels nor task-specific weight updates. Our key observation is that reproducible retrieval need not be discriminative: independent codebooks can consistently retrieve a few database hubs. TFA combines cross-codebook agreement, retrieval coverage, and spectral statistics to control residual assignment, spectral shaping, and global-feature fusion. Its spectral kernel exactly recovers original descriptor similarity at zero intervention. Database-only TFA fixes its rules before accessing queries; TFA-C64 uses 64 disjoint unlabeled target images to calibrate retrieval for subsequent queries. Across 20 ground protocols with a fixed DINOv2-B backbone and matched resolution, database-only TFA improves Recall@1 over AnyLoc by 17.39 percentage points on MSLS-val and 9.55 on SPED. C64 mitigates failures of database-only calibration in driving environments. Across eight aerial/cross-view protocols, TFA achieves the highest Recall@1 among compared training-free heads in 14 of 16 DINOv2/DINOv3 backbone-protocol combinations. In a separate native-system comparison, DINOv2-G-based TFA-C64 reaches 91.46% Recall@1 on Pitts30k and 76.29% on VPAIR, outperforming the displayed training-free comparators on all five benchmarks. These results show that reliability-guided aggregation can recover additional retrieval capability from frozen representations, providing a practical baseline for new environments with scarce place supervision.
Figures & tables
Figure 1: TFA overview. DB-fitted geometry and reliability evidence determine a fixed aggregation head. C64 adds 64 disjoint target images for calibration. Dashed arrows: fixed controls; solid: data. Feature diagrams are schematic; retrieval shows DB-only SPED q55, seed 0.
Figure 2: Selected Top-1 retrievals across five scene families. DINOv2-B, seed 0, DB-only TFA; green/red denote correct/incorrect matches. Each selected query is recovered by TFA but missed by all three baselines. RIA uses our reconstruction. Aggregate results: Tables 1 and 2 .
System
Backbone/interface
Pitts30k
SPED
St-Lucia
SVOX-5
VPAIR-full
Supervised References
BoQ p
native
93.7
92.5
100
98.38
29.3
SALAD p
DINOv2-B
92.4
92.1
100
97.66
22.1
SelaVPR++
DINOv2-L (perf.)
94.4 p
92.75 r
100.00 r
98.54 r
42.39 r
Training Free Systems
TF-VPR p
DINOv2-B
84.3
77.6
90.8
58.54
67.5
Table 3: Native-system comparison, R@1 (%). TFA uses the dual-vocabulary DINOv2-G L31 value configuration at 640×480 . TFA-C N : N disjoint calibration images (mean ± SD); TFA-FullQ (Cross-fit): two-fold query cross-fitting.
Spectral controls (TFA-FullQ assignment)
Complete heads
Map
Original
Partial
Full
Adaptive
TFA
TFA-C64
TFA-FullQ
cosine
whitening
whitening
spectrum
(a) Fixed transformations have map-dependent effects
Pitts30k
83.97
86.00
85.00
85.64
86.01
84.33 ± 1.59
86.00
SPED
76.00
83.31
85.34
85.01
85.12
83.79 ± 0.63
85.01
AmsterTime
45.71
52.69
0.76
48.87
44.84
52.00 ± 1.76
52.72
Table 4: Spectral controls and complete heads, R@1 (%). Controls fix the TFA-FullQ assignment; adaptive spectrum is SA before selection and CLS. C64: mean ± SD. Bold/underline: best/second-best.
Appendix figures & tables8 assets
Supplementary material from the paper’s appendix.
Appendix
Dataset / protocols
Original source and benchmark attribution
Pitts30k / Pitts250k
Pittsburgh imagery ( Torii et al., 2013 ) ; retrieval splits ( Arandjelović et al., 2016 ) .
MSLS-val
Mapillary Street-Level Sequences ( Warburg et al., 2020 ) .
Brussels subset of GSV-Cities ( Ali-bey et al., 2022 ) .
Essex3in1
Zaffar et al. (2021a) ; VPR-Bench release ( Zaffar et al., 2021b ) .
Appendix
Table 5: Dataset sources. Multiple maps, conditions, heights, and retrieval directions share their parent dataset reference.
System
Setup (s)
Retrieval (s)
Amortized (ms)
TFA
78.38 ± 1.78
7.01 ± 0.17
0.346 ± 0.008
TFA-C64
138.52 ± 2.83
27.22 ± 1.02
1.344 ± 0.050
Appendix
Table 6: Pitts30k deployment costs on H100, mean ± sample SD over three repetitions. Retrieval covers 6,752 queries and three codebook replicas. Amortized time is per query per replica, rather than batch-one latency.
Dataset
Backbone
AnyLoc
TF-VPR
RIA d
TFA
TFA-C64
TFA-FullQ
MSLS-val
DINOv2-B
52.70
41.49
44.41
70.09
71.16 ± 2.55
75.86
MSLS-val
DINOv3-B
47.39
40.54
39.77
72.21
63.17 ± 5.24
71.53
SPED
DINOv2-B
75.57
73.48
69.85
85.12
83.79 ± 0.63
85.01
SPED
DINOv3-B
70.95
76.94
69.85
87.92
85.75 ± 0.84
86.55
Nordland
DINOv2-B
29.50
29.46
21.03
39.60
30.23 ± 3.27
35.76
Nordland
DINOv3-B
25.15
30.81
19.07
40.17
31.51 ± 4.90
30.98
Appendix
Table 7: Ground-backbone comparison, R@1 (%). TFA uses DB-only calibration; C64 uses disjoint calibration (mean ± SD). TFA-FullQ is the transductive reference.
Figure 3: Disjoint calibration-size experiment, R@1. Blue: DINOv2-G dual-vocabulary TFA-C N system, mean ± SD over ten splits. The separated TFA-FullQ (Cross-fit) point uses opposite-fold query statistics (Table 3 ); its horizontal position is schematic. All points use the same backbone and dual-vocabulary configuration; calibration and evaluation sets follow the stated protocols.
Figure 4: Additional Top-1 retrievals where DB-only TFA succeeds and at least one baseline fails (DINOv2-B, seed 0). Green/red indicate correctness under the dataset positives; RIA uses our same-feature reconstruction. Two query-index-tertile examples per dataset exclude the main-figure queries. Images retain their full field of view.
Figure 5: Complementary failures: DB-only TFA misses a match recovered by at least one baseline. The protocol and sampling rule follow Figure 4 , with two examples per dataset. Correctness follows the dataset positives, not visual similarity alone.
Modern Visual Place Recognition (VPR) methods excel on standard benchmarks yet remain brittle in feature-poor environments. By treating each query image in isolation, they discard the sequential context in any real trajectory. We formalize a task that exploits this context: given a query sequence, localize the final image against an unordered reference database -- which, unlike sequence-to-sequence methods, requires no sequential structure in the database. We propose TRAIL (TRajectory-Aware Image Localization), a principled framework based on Conditional Random Fields (CRF) that combines learned functions for visual similarity and for camera-motion consistency, refining a distribution over candidate references as each query arrives. A lightweight post-processing layer atop any pre-trained VPR backbone, TRAIL improves a state-of-the-art baseline by up to 8.3 percentage points on our primary benchmark, transfers to unseen datasets without retraining, and delivers its largest gains where visual cues are scarce.
Dominik A. Kloepfer, Patrick Wenzel
Visual Geometry Group (VGG), University of Oxford · Helsing
Long-term Visual Place Recognition (VPR) is typically evaluated by matching queries from one condition against a database from another. Crowdsourced map databases, however, may mix conditions and include images that resemble the query in condition but depict different places. In the presence of these distractors, a method may retrieve by condition similarity rather than place identity. We argue that this susceptibility arises because the discriminability of VPR methods allows them to encode information such as illumination, weather, and seasonal appearance in their descriptors. We therefore introduce Distractor-Augmented Recall (DAR) to isolate and quantify the effect of distractors, and propose condition suppression to remove condition information from VPR descriptors. Across eleven methods and six datasets, method rankings under DAR@1 differ from those under Recall@1 (R@1), while applying INLP and LEACE as condition suppression methods generally improves DAR@1 without reducing R@1. Thus, distractor robustness is distinct from standard retrieval performance and can be improved by suppressing condition information.
Beomsu Kim, Minwoo Jung, Giseop Kim
Department of Robotics and Mechatronics Engineering, DGIST, Daegu, Republic of Korea · Department of Mechanical Engineering, Seoul National University, Seoul, Republic of Korea
Visual Place Recognition (VPR) aims to determine the geographic location of a query image by retrieving its most visually similar counterpart from a geo-tagged reference database. Recently, the emergence of the powerful visual foundation model, DINOv2, trained in a self-supervised manner on massive datasets, has significantly improved VPR performance. This improvement stems from DINOv2's exceptional feature generalization capabilities but is often accompanied by increased model complexity and computational overhead that impede deployment on resource-constrained devices. To address this challenge, we propose D2-VPR, a Distillation- and Deformable-based framework that retains the strong feature extraction capabilities of visual foundation models while significantly reducing model parameters and achieving a more favorable performance-efficiency trade-off. Specifically, first, we employ a two-stage training strategy that integrates knowledge distillation and fine-tuning. Additionally, we introduce a Distillation Recovery Module (DRM) to better align the feature spaces between the teacher and student models, thereby minimizing knowledge transfer losses to the greatest extent possible. Second, we design a Top-Down-attention-based Deformable Aggregator (TDDA) that leverages global semantic features to dynamically and adaptively adjust the Regions of Interest (ROI) used for aggregation, thereby improving adaptability to irregular structures. Extensive experiments demonstrate that our method achieves competitive performance compared to state-of-the-art approaches. Meanwhile, it reduces the parameter count by approximately 64.2% (compared to CricaVPR).Code is available at https://github.com/tony19980810/D2VPR.
Zheyuan Zhang, Jiwei Zhang, Boyu Zhou +2
School of Computer Science, Beijing University of Posts and Telecommunications · Key Laboratory of Interactive Technology and Experience System, Ministry of Culture and Tourism, Beijing University of Posts and Telecommunications