ROVER: Robust Loop Closure Verification with Trajectory Prior in Repetitive Environments

• URL: http://arxiv.org/abs/2508.13488v1
• Date: Tue, 19 Aug 2025 03:34:08 GMT
• Title: ROVER: Robust Loop Closure Verification with Trajectory Prior in Repetitive Environments
• Abstract summary: Loop detection is important for simultaneous localization and closure (SLAM)<n>We propose ROVER, a loop closure verification method that leverages the historical trajectory as a prior constraint to reject false loops.<n> Benchmark comparisons and real-world experiments demonstrate the effectiveness of the proposed method.
• Score: 29.075108845201164
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Loop closure detection is important for simultaneous localization and mapping (SLAM), which associates current observations with historical keyframes, achieving drift correction and global relocalization. However, a falsely detected loop can be fatal, and this is especially difficult in repetitive environments where appearance-based features fail due to the high similarity. Therefore, verification of a loop closure is a critical step in avoiding false positive detections. Existing works in loop closure verification predominantly focus on learning invariant appearance features, neglecting the prior knowledge of the robot's spatial-temporal motion cue, i.e., trajectory. In this letter, we propose ROVER, a loop closure verification method that leverages the historical trajectory as a prior constraint to reject false loops in challenging repetitive environments. For each loop candidate, it is first used to estimate the robot trajectory with pose-graph optimization. This trajectory is then submitted to a scoring scheme that assesses its compliance with the trajectory without the loop, which we refer to as the trajectory prior, to determine if the loop candidate should be accepted. Benchmark comparisons and real-world experiments demonstrate the effectiveness of the proposed method. Furthermore, we integrate ROVER into state-of-the-art SLAM systems to verify its robustness and efficiency. Our source code and self-collected dataset are available at https://github.com/jarvisyjw/ROVER.

Related papers

• FBFM: A Training-Free Asynchronous Feedback Mechanism for Flow-Matching in World-Action Models Execution [50.18922379062543]
  We present Feedback Flow Matching (FBFM), a training-free inference mechanism that pushes re-grounding inside actively generated chunks.<n>Being training-free, the mechanism improves responsiveness to unexpected events and suppresses drift in long-horizon tasks.<n>We evaluate FBFM on both a joint-generation WAM and a stage-wise WAM.
  arXiv  Detail & Related papers  (2026-07-31T10:11:09Z)
• From Open Loop to Closed Loop: A Test-Time Iterative Optimization Framework for Reference-Consistent Image Generation [108.02425846269234]
  controllable image generation has made significant strides by incorporating visual reference conditions.<n>Existing methods predominantly operate as open-loop systems.<n>We propose a novel test-time iterative optimization framework that reformulates reference-consistent generation as a closed-loop dynamic tracking problem.
  arXiv  Detail & Related papers  (2026-07-06T05:36:30Z)
• Heuristic-inspired Reasoning Priors Facilitate Data-Efficient Referring Object Detection [53.988759250627425]
  HeROD (Heuristic-inspired ROD) is a lightweight, model-agnostic framework that injects explicit, interpretable spatial and semantic reasonings.<n>HeROD consistently outperforms strong grounding baselines in scarcelabel regimes.
  arXiv  Detail & Related papers  (2026-03-25T10:33:22Z)
• Recover to Predict: Progressive Retrospective Learning for Variable-Length Trajectory Prediction [34.346912198889505]
  Trajectory prediction is critical for autonomous driving, enabling safe and efficient planning in dense, dynamic traffic.<n>Most existing methods optimize prediction accuracy under fixed-length observations.<n>A common strategy is to directly map features from incomplete observations to those from complete ones.<n>This one-shot mapping, however, struggles to learn accurate representations for short trajectories due to significant information gaps.<n>We propose a Progressive Retrospective Framework (PRF), which gradually aligns features from incomplete observations with those from complete ones.
  arXiv  Detail & Related papers  (2026-03-11T09:51:22Z)
• Loop Closure via Maximal Cliques in 3D LiDAR-Based SLAM [20.123895043037443]
  We introduce a novel deterministic algorithm, CliReg, for loop closure validation.<n>It replaces RANSAC verification with a maximal clique search over a compatibility graph of feature correspondences.<n>It consistently achieves a lower pose error and more reliable loop closures than RANSAC, especially in sparse or ambiguous conditions.
  arXiv  Detail & Related papers  (2026-03-05T17:24:44Z)
• Circular Reasoning: Understanding Self-Reinforcing Loops in Large Reasoning Models [66.11277323593475]
  Circular Reasoning is a self-reinforcing trap where generated content acts as a logical premise for its own recurrence.<n>Mechanistically, we characterize circular reasoning as a state collapse exhibiting distinct boundaries.<n>We reveal that reasoning impasses trigger the loop onset, which subsequently persists as an inescapable cycle driven by a self-reinforcing V-shaped attention mechanism.
  arXiv  Detail & Related papers  (2026-01-09T10:23:55Z)
• Pseudo-Simulation for Autonomous Driving [54.0732376977553]
  Existing evaluation paradigms for Autonomous Vehicles (AVs) face critical limitations.<n>Real-world evaluation is often challenging due to safety concerns and a lack of realism.<n>Open-loop evaluation relies on metrics that generally overlook compounding errors.
  arXiv  Detail & Related papers  (2025-06-04T17:57:53Z)
• Visual Loop Closure Detection Through Deep Graph Consensus [7.744347341643204]
  We introduce LoopGNN, a graph neural network architecture that estimates loop closure consensus by leveraging geometrics of visually similars retrieved through place recognition.<n>Our method yields high-precision estimates while maintaining high recall.
  arXiv  Detail & Related papers  (2025-05-27T20:42:47Z)
• GV-Bench: Benchmarking Local Feature Matching for Geometric Verification of Long-term Loop Closure Detection [32.54601978758081]
  Loop closures correct drifts in trajectory estimation to build a globally consistent map. A false loop closure can be fatal, so verification is required as an additional step to ensure robustness. This paper proposes a unified benchmark targeting geometric verification of loop closure detection under long-term conditional variations.
  arXiv  Detail & Related papers  (2024-07-16T14:05:19Z)
• RTracker: Recoverable Tracking via PN Tree Structured Memory [71.05904715104411]
  We propose a recoverable tracking framework, RTracker, that uses a tree-structured memory to dynamically associate a tracker and a detector to enable self-recovery. Specifically, we propose a Positive-Negative Tree-structured memory to chronologically store and maintain positive and negative target samples. Our core idea is to use the support samples of positive and negative target categories to establish a relative distance-based criterion for a reliable assessment of target loss.
  arXiv  Detail & Related papers  (2024-03-28T08:54:40Z)
• Revisiting Rotation Averaging: Uncertainties and Robust Losses [51.64986160468128]
  We argue that the main problem of current methods is the minimized cost function that is only weakly connected with the input data via the estimated epipolar. We propose to better model the underlying noise distributions by directly propagating the uncertainty from the point correspondences into the rotation averaging.
  arXiv  Detail & Related papers  (2023-03-09T11:51:20Z)
• Bi-directional Loop Closure for Visual SLAM [0.0]
  We propose an approach for bi-directional loop closure. This will provide us with the capability to relocalize to a location even when traveling in the opposite direction. We present a technique to select training data from large datasets in order to make them usable for the bi-directional problem.
  arXiv  Detail & Related papers  (2022-04-01T14:06:42Z)
• Loop closure detection using local 3D deep descriptors [22.93552565583209]
  We present a method to address loop closure detection in simultaneous localisation and mapping using local 3D deep descriptors (L3Ds) We propose a novel overlap measure for loop detection by computing the metric error between points that correspond to mutually-nearest-neighbour descriptors. This novel approach enables us to accurately detect loops and estimate six degrees-of-freedom poses in the case of small overlaps.
  arXiv  Detail & Related papers  (2021-10-31T09:18:38Z)
• Dense Label Encoding for Boundary Discontinuity Free Rotation Detection [69.75559390700887]
  This paper explores a relatively less-studied methodology based on classification. We propose new techniques to push its frontier in two aspects. Experiments and visual analysis on large-scale public datasets for aerial images show the effectiveness of our approach.
  arXiv  Detail & Related papers  (2020-11-19T05:42:02Z)
• Cascaded Regression Tracking: Towards Online Hard Distractor Discrimination [202.2562153608092]
  We propose a cascaded regression tracker with two sequential stages. In the first stage, we filter out abundant easily-identified negative candidates. In the second stage, a discrete sampling based ridge regression is designed to double-check the remaining ambiguous hard samples.
  arXiv  Detail & Related papers  (2020-06-18T07:48:01Z)
• Solving Missing-Annotation Object Detection with Background Recalibration Loss [49.42997894751021]
  This paper focuses on a novel and challenging detection scenario: A majority of true objects/instances is unlabeled in the datasets. Previous art has proposed to use soft sampling to re-weight the gradients of RoIs based on the overlaps with positive instances, while their method is mainly based on the two-stage detector. In this paper, we introduce a superior solution called Background Recalibration Loss (BRL) that can automatically re-calibrate the loss signals according to the pre-defined IoU threshold and input image.
  arXiv  Detail & Related papers  (2020-02-12T23:11:46Z)

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.