cs.ROOct 26, 2026

VPR-Space: A Benchmark for Visual Place Recognition in Space Analog Domains

Authors: Richard Fechner, Peer Neubert

Organizations: Institute for Computational Visualistics, University of Koblenz

Read PDF
Ask AI
Cite

Copy citation

DOINot available for this paper

Abstract

Visual Place Recognition (VPR) is an important means for loop closure detection in visual Simultaneous Localization and Mapping (SLAM). While state-of-the-art VPR and SLAM approaches excel in urban and feature-rich natural environments, the vast and feature-poor environments of extraterrestrial surfaces like on the Moon or Mars pose severe challenges for existing approaches. This paper presents a novel benchmark, VPR-Space, to evaluate VPR capabilities on extraterrestrial surfaces. There are three contributions: (1) We collected sixteen VPR database-query datasets based on existing data from Space Analog Domains (SAD), terrestrial environments that resemble properties of the Moon or Mars. The collection includes a range of challenges regarding environment, viewpoint change, and illumination conditions. (2) To address the ill-posed nature of VPR, we propose a novel approach to generate the ground-truth information in VPR benchmarks. Instead of defining that a query and datbase image show the same place if and only if their camera poses are within fixed position and viewing direction thresholds, we propose to make the decision dependent on whether the match would be valuable in the downstream SLAM task. To avoid the overhead and restrictions of evaluating VPR in-the-loop within SLAM systems, we provide VPR ground-truth (GT) matrices based on the performance of an ensemble of state-of-the-art Relative Pose Estimators (RPE). Under this GT we require a VPR method to identify exactly those image pairs for which a subsequently applied RPE is expected to provide a valuable pose estimate in a SLAM context. (3) We evaluated nine state-of-the-art VPR approaches. The results show considerable room for improvement and indicate directions for future research. We provide a pre-release version of the dataset on github: https://github.com/rfechner/VPR-Space\texttt{https://github.com/rfechner/VPR-Space}

Figures & tables

Fig. 1 : Image descriptor similarity histograms for Oxford RobotCar day–night [ 25 ] (left) and SPICE-HL³ noon–night [ 28 ] (right). We used Bag-of-Queries [ 2 ] , a SotA VPR method, to compute the descriptors. The distributions in the space analog domain are even less separable than in this challenging urban domain (i.e., there is no similarity threshold which approximately separates the positive and negative matchings).
Figure 2
DatasetGrayscaleRGBLiDARIMU/GyroGNSS/Poshard VChard ICMars analogMoon analog
Devon Island [ 9 ]✗✓✗✗✓✓✗✓✗
MADMAX [ 26 ]✗✓✗✓✓✓✗✓✗
S3LI Vulcano [ 12 ]✗✓✓✗✓✓✗✓✗
S3LI Etna [ 13 ]✓✗✓✓✓✓✗✓✗
Erfoud [ 21 ]✓✗✓✓✓✓✗✓✗
ROBEX [ 35 ]✓✗✗✓✓✓✗✓✓
TABLE I : Sensor modalities relevant to VPR and attributes of SLAM datasets in space domains. The properties Viewpoint Change (VC) and Illumination Change (IC) denote the existence of hard viewpoint- and illumination changes within and between two sequences of the dataset respectively.
Fig. 4 : An overview of the database (blue) and query (red) sequences of the VPR-Space benchmark. We show example matches from both sequences to illustrate the shape of the task. For SPICE-HL³, database and query sequence lie on top of each other.
Fig. 5 : GT matrices (hard GT in dark, soft GT in light color) and Precision-Recall Curves for VPR-GTs of different constructions. To enable comparison, the number of positive matches is equalized across constructions. This example illustrates that established GT constructions tend to request harder matches. This pattern repeats across the dataset.
Fig. 6 : Examples of hard queries in VPR-Space, illustrating the challenges of space analog domains. A query image (dark blue) has highest similarity to a false positive image (orange) outside its VPR-GT. The best correct image (green) inside the hard ground truth is displayed in the center. The margin between the similarities indicates the severity of the example.
VPR chall.DB/Q pairMeLo [ 5 ]BoQ [ 2 ]SLD [ 16 ]AnyL [ 18 ]DenV [ 34 ]
Viewpoint changeMM A0 – A20.670.700.650.680.69
MM A2 – A40.360.410.390.290.32
MM C0 – C10.510.520.410.330.31
MM E0 – E10.330.300.230.260.30
MM F0 – F30.790.710.680.630.57
MM G0 – G20.570.490.480.500.41
TABLE II : AUPRC of SotA VPR methods on all sequence comparisons. Best per row in bold, runner-up underlined.
CaseMethodR@1R@5R@10R@100p
Worst caseMeLo0.240.460.530.00
BoQ0.380.590.690.00
SLD0.250.560.660.00
AnyL0.310.540.640.001
DenV0.060.230.330.00
Avg. ±\pm stdMeLo0.59 ±\pm 0.250.75 ±\pm 0.190.81 ±\pm 0.150.07 ±\pm 0.07
TABLE III : Recall@k and recall@100% precision of SotA VPR methods. Best per row in bold, runner-up underlined
 # Images% queries% of pos.
DB/Q pairDBQw/ matchmatches
MM A0 – A217118092.88.55
MM A2 – A418041220.90.74
MM C0 – C150246378.61.89
MM E0 – E151750743.20.62
MM F0 – F311722989.15.14
TABLE IV : Additional dataset statistics. For each database/query pair we report the number of images, the percentage of queries which have at least one match (% queries w/ match) and the percentage of positive matches (% of pos. matches) given the proposed VPR-GT-RPE-0.
 MADMAXS3LI EtnaLunarLocSPICE-HL 3
 softhardsofthardsofthardsofthard
dmax⁡d_{\max} [m]35353535353511
τt\tau_{t} [m]4343430.40.2
τR\tau_{R} [ ∘ ]3020302030202010
nn24242411
TABLE V : Hyperparameters used for VPR-GT-RPE-0.
More in this topic

Visual Place Recognition

Visual Place Recognition matches camera observations to mapped places despite changes in viewpoint, lighting, weather, or time.

See all 84 papers

Explore similar work

CardsList
Jul 14, 2026

Breaking Déjà Vu: Independent Auditing of Visual Place Recognition through Vision-Language Reasoning

Visual place recognition (VPR) is a key enabler of accurate localization and long-term autonomous navigation in robotics applications, such as loop closure detection for simultaneous localisation and mapping (SLAM). However, real-world VPR deployment relies on selecting an image matching threshold that balances precision and recall. These thresholds are typically tuned using labeled validation data and fixed during deployment, making them unreliable under environmental changes where ground truth is unavailable. This is particularly problematic in safety-critical robotics, where accepting a false loop closure can corrupt the estimated trajectory and map. In this work, we introduce Visual Place Recognition Auditing, an independent post-retrieval verification framework that leverages Vision-Language Models (VLMs) to assess retrieved matches by reasoning jointly over query and candidate images. Unlike conventional verification methods, our approach performs instance-level verification without requiring architecture-specific confidence measures, dataset-dependent thresholds, or prior knowledge of the deployment environment. We evaluate our method on six benchmark datasets using five state-of-the-art VPR methods and four VLMs. Results show that VLM-based auditing improves recall@1 by 13.6% on average as compared to state-of-the-art methods while reducing false acceptance rates to 12%, maintaining precision above 95% and coverage above 75%.

Sania Waheed, Michael Milford, Sarvapali D. Ramchurn +1

School of Electronics and Computer Science, University of Southampton, Southampton SO17 1BJ, U.K. · School of Electrical Engineering and Computer Science, Queensland University of Technology, Brisbane, QLD 4000, Australia · School of Computer Science and Electronic Engineering, University of Essex, CO4 3SQ Colchester, U.K.

Visual Place RecognitionRobot Localization
AskPDF
Mar 8, 2026

QdaVPR: A novel query-based domain-agnostic model for visual place recognition

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

Visual Place RecognitionDomain Generalization
AskPDF
Jul 6, 2026

SLAM: Structured and Localized Analytic Manifold Adaptation for Lifelong VPR

Visual Place Recognition (VPR) in lifelong deployment requires continuous adaptation to new environments without catastrophic forgetting. In this paper, we propose SLAM, a Structured and Localized Analytic Manifold adaptation framework. Our framework elegantly unifies uncertainty-aware smoothing via Unscented transformation, topological space partitioning through a Gaussian Mixture Model (GMM), and H∞H_\infty robust bound optimization into a singular, unified closed-form analytical recursion. Exhaustive ablation studies demonstrate that while the synergistic combination of uncertainty smoothing and localized mapping (U+G configuration) achieves the state-of-the-art nominal accuracy of 27.5%, the full deployment of the H∞H_\infty bound does not require an architectural split; rather, it introduces a mathematically guaranteed minimax robust bound. This formulation enables the system to seamlessly modulate the intrinsic trade-off between nominal placement precision and worst-case disturbance attenuation through a single regularization parameter.

Kenta Tsukahara, Kanji Tanaka, Rai Hisada

Department of Mechanical Engineering, Faculty of Engineering, University of Fukui, Fukui 910-8507, Japan

Visual Place RecognitionContinual LearningRobust Optimization
AskPDF