Automatic Map Density Selection for Locally-Performant Visual Place Recognition

• URL: http://arxiv.org/abs/2602.21473v2
• Date: Wed, 04 Mar 2026 04:53:51 GMT
• Title: Automatic Map Density Selection for Locally-Performant Visual Place Recognition
• Authors: Somayeh Hussaini, Tobias Fischer, Michael Milford,
• Abstract summary: We propose a dynamic VPR mapping approach that uses pairs of reference traverses from the target environment to automatically select an appropriate map density.<n>We show that our system consistently achieves or exceeds the specified local recall level over at least the user-specified proportion of the environment.
• Score: 16.893170921147608
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A key challenge in translating Visual Place Recognition (VPR) from the lab to long-term deployment is ensuring a priori that a system can meet user-specified performance requirements across different parts of an environment, rather than just on average globally. A critical mechanism for controlling local VPR performance is the density of the reference mapping database, yet this factor is largely neglected in existing work, where benchmark datasets with fixed, engineering-driven (sensors, storage, GPS frequency) sampling densities are typically used. In this paper, we propose a dynamic VPR mapping approach that uses pairs of reference traverses from the target environment to automatically select an appropriate map density to satisfy two user-defined requirements: (1) a target Local Recall@1 level, and (2) the proportion of the operational environment over which this requirement must be met or exceeded, which we term the Recall Achievement Rate (RAR). Our approach is based on the hypothesis that match patterns between multiple reference traverses, evaluated across different map densities, can be modelled to predict the density required to meet these performance targets on unseen deployment data. Through extensive experiments across multiple VPR methods and the Nordland and Oxford RobotCar benchmarks, we show that our system consistently achieves or exceeds the specified local recall level over at least the user-specified proportion of the environment. Comparisons with alternative baselines demonstrate that our approach reliably selects the correct operating point in map density, avoiding unnecessary over-densification. Finally, ablation studies and analysis evaluate sensitivity to reference map choice and local space definitions, and reveal that conventional global Recall@1 is a poor predictor of the often more operationally meaningful RAR metric.

Related papers

• Quantile Transfer for Reliable Operating Point Selection in Visual Place Recognition [15.33833908429706]
  Thresholds are typically hand-tuned offline for a specific environment and fixed during deployment, leading to degraded performance under environmental change.<n>We propose a method that, given a user-defined precision requirement, automatically selects the operating point of a VPR system to maximise recall.<n> Experiments with multiple state-of-the-art VPR techniques and datasets show that the proposed approach consistently outperforms the state-of-the-art.
  arXiv  Detail & Related papers  (2026-02-04T10:31:29Z)
• Through the Lens of Doubt: Robust and Efficient Uncertainty Estimation for Visual Place Recognition [11.33609434801822]
  Visual Place Recognition enables robots to identify previously visited locations by matching current observations against a database of known places.<n>Failure-critical VPR applications, such as loop closure detection in simultaneous localization and mapping pipelines, require robust estimation of place matching uncertainty.<n>We propose three training-free uncertainty metrics that estimate prediction confidence by analyzing inherent statistical patterns in similarity scores from any existing VPR method.
  arXiv  Detail & Related papers  (2025-10-15T12:12:55Z)
• PRISM-Loc: a Lightweight Long-range LiDAR Localization in Urban Environments with Topological Maps [0.8009940044669193]
  We propose PRISM-Loc -- a topological map-based approach for localization in large environments.<n>The proposed approach leverages a twofold localization pipeline, which consists of global place recognition and estimation of the local pose inside the found location.<n>We evaluate the proposed method on the ITLP-Campus dataset on a 3 km route, and compare it against the state-of-the-art metric map-based and place recognition-based competitors.
  arXiv  Detail & Related papers  (2025-06-18T19:59:50Z)
• GEOBench-VLM: Benchmarking Vision-Language Models for Geospatial Tasks [84.86699025256705]
  We present GEOBench-VLM, a benchmark specifically designed to evaluate Vision-Language Models (VLMs) on geospatial tasks.<n>Our benchmark features over 10,000 manually verified instructions and spanning diverse visual conditions, object types, and scales.<n>We evaluate several state-of-the-art VLMs to assess performance on geospatial-specific challenges.
  arXiv  Detail & Related papers  (2024-11-28T18:59:56Z)
• Deep Homography Estimation for Visual Place Recognition [49.235432979736395]
  We propose a transformer-based deep homography estimation (DHE) network. It takes the dense feature map extracted by a backbone network as input and fits homography for fast and learnable geometric verification. Experiments on benchmark datasets show that our method can outperform several state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-02-25T13:22:17Z)
• AANet: Aggregation and Alignment Network with Semi-hard Positive Sample Mining for Hierarchical Place Recognition [48.043749855085025]
  Visual place recognition (VPR) is one of the research hotspots in robotics, which uses visual information to locate robots. We present a unified network capable of extracting global features for retrieving candidates via an aggregation module. We also propose a Semi-hard Positive Sample Mining (ShPSM) strategy to select appropriate hard positive images for training more robust VPR networks.
  arXiv  Detail & Related papers  (2023-10-08T14:46:11Z)
• Learning Classifiers of Prototypes and Reciprocal Points for Universal Domain Adaptation [79.62038105814658]
  Universal Domain aims to transfer the knowledge between datasets by handling two shifts: domain-shift and categoryshift. Main challenge is correctly distinguishing the unknown target samples while adapting the distribution of known class knowledge from source to target. Most existing methods approach this problem by first training the target adapted known and then relying on the single threshold to distinguish unknown target samples.
  arXiv  Detail & Related papers  (2022-12-16T09:01:57Z)
• Rethinking Counting and Localization in Crowds:A Purely Point-Based Framework [59.578339075658995]
  We propose a purely point-based framework for joint crowd counting and individual localization. We design an intuitive solution under this framework, which is called Point to Point Network (P2PNet)
  arXiv  Detail & Related papers  (2021-07-27T11:41:50Z)
• A Hierarchical Dual Model of Environment- and Place-Specific Utility for Visual Place Recognition [26.845945347572446]
  We present a novel approach to deduce two key types of utility for Visual Place Recognition (VPR) We employ contrastive learning principles to estimate both the environment- and place-specific utility of Vector of Locally Aggregated Descriptors (VLAD) clusters. By combining these two utility measures, our approach achieves state-of-the-art performance on three challenging benchmark datasets.
  arXiv  Detail & Related papers  (2021-07-06T07:38:47Z)
• DiSCO: Differentiable Scan Context with Orientation [13.797651328615347]
  We propose a LiDAR-based place recognition method, named Differentiable Scan Context with Orientation (DiSCO) It simultaneously finds the scan at a similar place and estimates their relative orientation. DiSCO is validated on three datasets with long-term outdoor conditions.
  arXiv  Detail & Related papers  (2020-10-21T12:38:21Z)
• Collaborative Training between Region Proposal Localization and Classification for Domain Adaptive Object Detection [121.28769542994664]
  Domain adaptation for object detection tries to adapt the detector from labeled datasets to unlabeled ones for better performance. In this paper, we are the first to reveal that the region proposal network (RPN) and region proposal classifier(RPC) demonstrate significantly different transferability when facing large domain gap.
  arXiv  Detail & Related papers  (2020-09-17T07:39:52Z)
• Scope Head for Accurate Localization in Object Detection [135.9979405835606]
  We propose a novel detector coined as ScopeNet, which models anchors of each location as a mutually dependent relationship. With our concise and effective design, the proposed ScopeNet achieves state-of-the-art results on COCO.
  arXiv  Detail & Related papers  (2020-05-11T04:00:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.