REGRACE: A Robust and Efficient Graph-based Re-localization Algorithm using Consistency Evaluation

• URL: http://arxiv.org/abs/2503.03599v2
• Date: Mon, 28 Jul 2025 16:40:38 GMT
• Title: REGRACE: A Robust and Efficient Graph-based Re-localization Algorithm using Consistency Evaluation
• Authors: Débora N. P. Oliveira, Joshua Knights, Sebastián Barbas Laina, Simon Boche, Wolfram Burgard, Stefan Leutenegger,
• Abstract summary: Loop closures are essential for correcting odometry drift and creating consistent maps.<n>Current methods using dense point clouds for accurate place recognition do not scale well due to computationally expensive scan-to-scan comparisons.<n>We introduce REGRACE, a novel approach that addresses these challenges of scalability and perspective difference in re-localization.
• Score: 23.41000678070751
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Loop closures are essential for correcting odometry drift and creating consistent maps, especially in the context of large-scale navigation. Current methods using dense point clouds for accurate place recognition do not scale well due to computationally expensive scan-to-scan comparisons. Alternative object-centric approaches are more efficient but often struggle with sensitivity to viewpoint variation. In this work, we introduce REGRACE, a novel approach that addresses these challenges of scalability and perspective difference in re-localization by using LiDAR-based submaps. We introduce rotation-invariant features for each labeled object and enhance them with neighborhood context through a graph neural network. To identify potential revisits, we employ a scalable bag-of-words approach, pooling one learned global feature per submap. Additionally, we define a revisit with geometrical consistency cues rather than embedding distance, allowing us to recognize far-away loop closures. Our evaluations demonstrate that REGRACE achieves similar results compared to state-of-the-art place recognition and registration baselines while being twice as fast. Code and models are publicly available.

Related papers

• CLIP-Clique: Graph-based Correspondence Matching Augmented by Vision Language Models for Object-based Global Localization [0.0]
  One of the most promising approaches for localization on object maps is to use semantic graph matching. To address the former issue, we augment the correspondence matching using Vision Language Models. In addition, inliers are estimated deterministically using a graph-theoretic approach.
  arXiv  Detail & Related papers  (2024-10-04T00:23:20Z)
• 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)
• CPR++: Object Localization via Single Coarse Point Supervision [55.8671776333499]
  coarse point refinement (CPR) is first attempt to alleviate semantic variance from an algorithmic perspective. CPR reduces semantic variance by selecting a semantic centre point in a neighbourhood region to replace the initial annotated point. CPR++ can obtain scale information and further reduce the semantic variance in a global region.
  arXiv  Detail & Related papers  (2024-01-30T17:38:48Z)
• GraffMatch: Global Matching of 3D Lines and Planes for Wide Baseline LiDAR Registration [41.00550745153015]
  Using geometric landmarks like lines and planes can increase navigation accuracy and decrease map storage requirements. However, landmark-based registration for applications like loop closure detection is challenging because a reliable initial guess is not available. We adopt the affine Grassmannian manifold to represent 3D lines and planes and prove that the distance between two landmarks is invariant to rotation and translation.
  arXiv  Detail & Related papers  (2022-12-24T15:02:15Z)
• Adaptive Local-Component-aware Graph Convolutional Network for One-shot Skeleton-based Action Recognition [54.23513799338309]
  We present an Adaptive Local-Component-aware Graph Convolutional Network for skeleton-based action recognition. Our method provides a stronger representation than the global embedding and helps our model reach state-of-the-art.
  arXiv  Detail & Related papers  (2022-09-21T02:33:07Z)
• Rethinking Spatial Invariance of Convolutional Networks for Object Counting [119.83017534355842]
  We try to use locally connected Gaussian kernels to replace the original convolution filter to estimate the spatial position in the density map. Inspired by previous work, we propose a low-rank approximation accompanied with translation invariance to favorably implement the approximation of massive Gaussian convolution. Our methods significantly outperform other state-of-the-art methods and achieve promising learning of the spatial position of objects.
  arXiv  Detail & Related papers  (2022-06-10T17:51:25Z)
• Object-Augmented RGB-D SLAM for Wide-Disparity Relocalisation [3.888848425698769]
  We propose a novel object-augmented RGB-D SLAM system that is capable of constructing a consistent object map and performing relocalisation based on centroids of objects in the map.
  arXiv  Detail & Related papers  (2021-08-05T11:02:25Z)
• Automatic Vocabulary and Graph Verification for Accurate Loop Closure Detection [21.862978912891677]
  Bag-of-Words (BoW) builds a visual vocabulary to associate features and then detect loops. We propose a natural convergence criterion based on the comparison between the radii of nodes and the drifts of feature descriptors. We present a novel topological graph verification method for validating candidate loops.
  arXiv  Detail & Related papers  (2021-07-30T13:19:33Z)
• 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)
• 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)
• Making Affine Correspondences Work in Camera Geometry Computation [62.7633180470428]
  Local features provide region-to-region rather than point-to-point correspondences. We propose guidelines for effective use of region-to-region matches in the course of a full model estimation pipeline. Experiments show that affine solvers can achieve accuracy comparable to point-based solvers at faster run-times.
  arXiv  Detail & Related papers  (2020-07-20T12:07:48Z)
• RPM-Net: Robust Point Matching using Learned Features [79.52112840465558]
  RPM-Net is a less sensitive and more robust deep learning-based approach for rigid point cloud registration. Unlike some existing methods, our RPM-Net handles missing correspondences and point clouds with partial visibility.
  arXiv  Detail & Related papers  (2020-03-30T13:45:27Z)

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.