Organizations: Department of Precision Instrument, Tsinghua University, Beijing 100084, China · School of Aerospace Engineering, Beijing Institute of Technology, Beijing 100081, China · School of Instrumentation Science and Opto-electronics Engineering, Beijing Information Science and Technology University, Beijing 100192, China · School of Intelligent Systems Engineering, Sun Yat-sen University, Guangzhou 510275, China
In this work, we propose HE-VPR, a visual place recognition (VPR) framework that incorporates height estimation. Our system decouples height inference from place recognition, allowing both modules to share a frozen DINOv2 backbone. Two lightweight bypass adapter branches are integrated into our system. The first estimates the height partition of the query image via retrieval from a compact height database, and the second performs VPR within the corresponding height-specific sub-database. The adaptation design reduces training cost and significantly decreases the search space of the database. We also adopt a center-weighted masking strategy to further enhance the robustness against scale differences. Experiments on two self-collected challenging multi-altitude datasets demonstrate that HE-VPR achieves up to 6.1% Recall@1 improvement over state-of-the-art ViT-based baselines and reduces memory usage by up to 90%. These results indicate that HE-VPR offers a scalable and efficient solution for height-aware aerial VPR, enabling practical deployment in GNSS-denied environments. All the code and datasets for this work have been released on https://github.com/hmf21/HE-VPR.
Figures & tables
Fig. 1 : Overview of the proposed HE-VPR, an aerial VPR pipeline with height estimation.
Fig. 2 : Illustration of the adapter network in ViT.
Fig. 3 : The proposed HE-VPR pipeline. A height estimation branch is added for sub-database selection such that the proposed pipeline is robust to height variance. It requires only a single forward pass of the model for both parts.
Dataset
Query Image
Height Database
VPR Database
Height Range ( m )
GEStudio
1200
102
29768
100 ∼ 1200
MHFlight
1970
850
36400
200 ∼ 640
TABLE I : The statistics of GEStudio and MHFlight.
Fig. 4 : Overviews of two evaluation datasets.
Method
R @ 1
R @ 5
R @ 10
E avg
threshold at 50 m and 100 m ( % / % )
( m )
GEStudio dataset
UniDepth V2
1.25/8.50
N/A
N/A
470.83
DA V2
5.58/15.00
N/A
N/A
550.03
HE-VPR
63.08/91.75
92.33/99.92
98.25/100.00
43.63
TABLE II : Evaluation for the height estimation. We present the performance with height thresholds of 50m and 100m to define a correct retrieval. We compare with two MMDE methods, namely UniDepth V2 and Depth Anything (DA) v2. The best result is highlighted in bold.
Fig. 5 : Qualitative results for height estimation. The top two rows are from GEStudio dataset and the bottom two rows are from MHFlight dataset. The height label for top-5 database image is annotated at the top and all the samples are correctly retrieved at the top-1 candidate.
Dataset
Database
R @ 1
R @ 5
R @ 10
GEStudio
M
36.50/54.25
73.33/91.08
91.58/98.33
G
63.08/91.75
92.33/99.92
98.25/100.00
∗ G ∗
61.58/91.33
90.25/99.75
95.58/99.92
MHFlight
G
29.04/49.75
52.08/67.26
66.29/72.13
M
34.01/60.96
76.95/91.83
89.85/96.80
TABLE III : Height estimation performance with different databases. In this evaluation, G and M denote denote databases sharing similar scene domains (e.g., urban and rural environments) with the GEStudio and MHFlight datasets, respectively. And the superscript ∗ indicates a database that is larger than the original database.
Method
Backbone
Dim
Param.
GEStudio dataset
MHFlight dataset
( MB )
R @ 1
R @ 5
R @ 10
R @ 1
R @ 5
R @ 10
GeM [ 23 ]
ResNet50
1024
8.5
20.08/24.00
35.75/42.33
43.08/51.67
37.31/63.81
61.88/75.69
69.34/78.88
CosPlace [ 31 ]
ResNet50
2048
27.7
47.92/51.50
61.42/66.50
66.17/71.83
55.89/83.35
67.61/84.62
72.99/84.87
MixVPR [ 27 ]
ResNet50
4096
10.9
50.75/53.92
61.08/65.67
66.00/70.92
58.63 /84.47
71.83/84.82
77.26/85.03
CricaVPR [ 6 ]
DINOv2-B
10752
106.8
61.17/65.58
73.25/76.75
76.42/79.67
57.21/83.20
70.00/84.37
76.19/84.47
TABLE IV : VPR comparison of different methods. We only use the VPR adapter branch for evaluation. Here we also present the performance under different thresholds with 100 m and 200 m . The best results are shown in bold.
Method
GEStudio dataset
MHFlight dataset
R @ 1
R @ 5
R @ 10
R @ 1
R @ 5
R @ 10
Adapter(full)
69.50
76.42
79.08
57.61
72.49
77.82
HE-VPR(1)
57.25
66.50
70.00
49.14
68.07
74.06
HE-VPR(5)
69.92
76.17
78.67
56.80
72.94
77.72
HE-VPR(10)
70.42
76.83
79.00
57.41
71.93
77.46
TABLE V : Comparison between the standalone VPR adapter branch and the proposed HE-VPR system.
Method
Full
HE-VPR(1)
HE-VPR(5)
HE-VPR(10)
GEStudio dataset
Memory Usage ( % )
100
12.50
38.71
58.51
Performance Ratio ( % )
100
86.11 -13.89
99.89 -0.11
100.56 +0.56
MHFlight dataset
Memory Usage ( % )
100
7.14
27.18
42.66
TABLE VI : Comparison for memory usage and performance ratio of database.
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
Visual place recognition (VPR) aiming at predicting the location of an image based solely on its visual features is a fundamental task in robotics and autonomous systems. Domain variation remains one of the main challenges in VPR and is relatively unexplored. Existing VPR models attempt to achieve domain agnosticism either by training on large-scale datasets that inherently contain some domain variations, or by being specifically adapted to particular target domains. In practice, the former lacks explicit domain supervision, while the latter generalizes poorly to unseen domain shifts. This paper proposes a novel query-based domain-agnostic VPR model called QdaVPR. First, a dual-level adversarial learning framework is designed to encourage domain invariance for both the query features forming the global descriptor and the image features from which these query features are derived. Then, a triplet supervision based on query combinations is designed to enhance the discriminative power of the global descriptors. To support the learning process, we augment a large-scale VPR dataset using style transfer methods, generating various synthetic domains with corresponding domain labels as auxiliary supervision. Extensive experiments show that QdaVPR achieves state-of-the-art performance on multiple VPR benchmarks with significant domain variations. Specifically, it attains the best Recall@1 and Recall@10 on nearly all test scenarios: 93.5%/98.6% on Nordland (seasonal changes), 97.5%/99.0% on Tokyo24/7 (day-night transitions), and the highest Recall@1 across almost all weather conditions on the SVOX dataset. Our code will be released at https://github.com/shuimushan/QdaVPR.
Shanshan Wan, Lai Kang, Yingmei Wei +3
College of Systems Engineering and the Laboratory for Big Data and Decision, National University of Defense Technology, Changsha, Hunan 410073, China
Recent visual place recognition (VPR) studies have increasingly relied on large-scale datasets to train more robust and discriminative models. Although this trend significantly improves recognition performance, it also introduces substantial storage and training costs, especially when new architectures or training strategies need to be repeatedly developed and evaluated. Dataset pruning (DP) provides a promising way to improve data efficiency by retaining only informative training data. However, conventional DP methods mainly follow the sample-wise classification paradigm, which overlooks the relation-dependent training nature of VPR, where supervision is typically formed by image pairs rather than independent images. To address this issue, we propose a place-wise dataset pruning framework tailored for VPR. Instead of pruning individual images, our method treats each place as the basic pruning unit and introduces two complementary novel metrics, i.e., intra-place diversity (IPD) and inter-place similarity (IPS), to evaluate the training value of each place. By jointly considering these two metrics, our method ranks all places and constructs a compact yet informative coreset, thereby allowing the pruned dataset to still support the training of robust and discriminative VPR models. Extensive experiments demonstrate that our method consistently outperforms state-of-the-art DP baselines under different pruning ratios while reducing selection and training costs. Moreover, by pruning a merged dataset roughly 3.5× the size of GSV-Cities to a comparable scale, our coreset maintains highly competitive performance, achieving 94.5% R@1 on MSLS-val and 97.0% R@1 on Nordland with only NetVLAD. Codes will be made publicly available.
Tong Jin, Yunpeng Liu, Shuyu Hu +3
Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China · University of Chinese Academy of Sciences, Beijing 100049, China · Tsinghua Shenzhen International Graduate School, Tsinghua University, Shenzhen 518071, China +1