Self-supervised Geometry Reasoning for LiDAR Simultaneous Localization and Mapping

• URL: http://arxiv.org/abs/2606.30166v1
• Date: Mon, 29 Jun 2026 11:43:20 GMT
• Title: Self-supervised Geometry Reasoning for LiDAR Simultaneous Localization and Mapping
• Abstract summary: This paper introduces a self-supervised framework that learns an explicit symbolic representation of local geometry and uses it to improve LiDAR SLAM.<n> Experiments on KITTI under varying LiDAR resolutions show that the proposed method improves both odometry and global registration.
• Score: 11.695017334165287
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: LiDAR simultaneous localization and mapping (SLAM) relies on local geometric quantities such as covariances, correspondences, and surface structures. However, most existing pipelines rely on hand-crafted estimates of local geometry and use them as fixed inputs to LiDAR SLAM, which can make the estimated local geometry noisy and unstable in sparse regions of a point cloud or when using low-resolution LiDAR. To address this issue, this paper introduces a self-supervised framework that learns an explicit symbolic representation of local geometry and uses it to improve LiDAR SLAM recursively. Specifically, each point is represented as a Gaussian distribution, allowing local geometry to be described by a covariance. Without dense geometry labels or ground-truth poses, the framework learns by maximizing the likelihood of local geometry, with self-supervision derived from consistency relations over symbolic geometric representations, including predicted covariances, correspondences, and trajectory from SLAM. The learned geometry is then fed back into LiDAR SLAM, forming a reciprocal loop in which improved geometry enhances localization and mapping, and improved localization provides cleaner supervision for subsequent geometry reasoning. This framework is backend-agnostic and can be plugged into existing LiDAR SLAM pipelines without architectural changes. Experiments on KITTI under varying LiDAR resolutions show that the proposed method improves both odometry and global registration.

Related papers

• Improving Map Consistency in Graph-Based LiDAR SLAM Through Information-Aware Odometry and Retroactive Loop Closure [22.762295959731233]
  We address the problem of improving global trajectory estimation and local map quality in 3D LiDAR SLAM.<n>We first propose a framework to efficiently estimate geometry-dependent information matrices for ICP, enabling principled weighting of odometry constraints in a pose graph.<n>We then introduce a hierarchical loop-closure module that decouples place recognition from geometric registration, together with a retroactive loop-closure module that exploits the optimized pose graph to recover missed loop closures.
  arXiv  Detail & Related papers  (2026-07-15T07:12:14Z)
• Real-Time LiDAR Gaussian Splatting SLAM [2.0524609401792397]
  We present a real-time LiDAR-based framework for Splatting SLAM that tightly couples fast G-ICP registration with sphericalization-based dense mapping for large-scale sequences.<n>We reuse tracking-estimated local covariances to initialize Gaussians with range-aware scales and to derive surface normals for map optimization.<n>On the Newer College dataset, our method achieves an F-score of 86.78% using purely online trajectories at real-time speed.
  arXiv  Detail & Related papers  (2026-07-05T05:55:32Z)
• Learning Point Cloud Geometry as a Statistical Manifold: Theory and Practice [11.695017334165287]
  LiDAR-acquired point clouds are inherently sparse and non-uniform.<n>Existing approaches attempt to compensate for these limitations by estimating local geometry.<n>We introduce Point-to-Ellipsoid (POLI), a deep neural estimator that predicts per-point Gaussian geometry.
  arXiv  Detail & Related papers  (2026-05-11T12:27:25Z)
• A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning [52.452902154360565]
  We introduce Mean Curvature Boundary Points (MCBP), a novel geometric framework grounded in Geometric Machine Learning.<n>MCBP explicitly models the intrinsic curvature of the data manifold and computes pointwise mean curvature without requiring principled manifold parametrization.<n>Experiments on synthetic and real-world datasets demonstrate that MCBP consistently improves clustering performance.
  arXiv  Detail & Related papers  (2026-05-05T20:19:09Z)
• Incremental Semantics-Aided Meshing from LiDAR-Inertial Odometry and RGB Direct Label Transfer [3.2208886039079925]
  We propose a modular, incremental RGB+LiDAR pipeline that generates semantics-aided high-quality meshes from indoor scans.<n>A vision foundation model labels each incoming RGB frame; labels are incrementally projected and fused onto a LiDAR-inertial odometry map.<n>The resulting semantically labelled meshes are of value when reconstructing Universal Scene Description (USD) assets.
  arXiv  Detail & Related papers  (2026-04-10T16:41:47Z)
• Non-Rigid Structure-from-Motion via Differential Geometry with Recoverable Conformal Scale [17.935227965480475]
  We introduce a novel method, called Con-NRSfM, for NRSfM under conformal deformations.<n>Our approach performs point-wise reconstruction using 2D selected image warps optimized through a graph-based framework.<n>Our framework decouples constraints on depth and conformal scale, which are inseparable in other approaches.
  arXiv  Detail & Related papers  (2025-10-02T04:46:46Z)
• Local-consistent Transformation Learning for Rotation-invariant Point Cloud Analysis [61.04787144322498]
  We propose a Local-consistent Transformation (LocoTrans) learning strategy for point shape analysis. We first construct the local-consistent reference frame (LCRF) by considering the symmetry of the two axes in LRF. As the consistency only exists in local regions, the relative pose information is still lost in the intermediate layers of the network.
  arXiv  Detail & Related papers  (2024-03-17T06:40:50Z)
• The Fisher-Rao geometry of CES distributions [50.50897590847961]
  The Fisher-Rao information geometry allows for leveraging tools from differential geometry. We will present some practical uses of these geometric tools in the framework of elliptical distributions.
  arXiv  Detail & Related papers  (2023-10-02T09:23:32Z)
• Exploring Data Geometry for Continual Learning [64.4358878435983]
  We study continual learning from a novel perspective by exploring data geometry for the non-stationary stream of data. Our method dynamically expands the geometry of the underlying space to match growing geometric structures induced by new data. Experiments show that our method achieves better performance than baseline methods designed in Euclidean space.
  arXiv  Detail & Related papers  (2023-04-08T06:35:25Z)
• LMBAO: A Landmark Map for Bundle Adjustment Odometry in LiDAR SLAM [2.218316486552747]
  Existing LiDAR odometry tends to match a new scan simply iteratively with previous fixed-pose scans, gradually accumulating errors. This letter designs a new strategy named a landmark map for bundle adjustment odometry (LMBAO) in LiDAR SLAM to solve these problems. Specifically, this paper keeps entire stable landmarks on the map instead of just their feature points in the sliding window and deletes the landmarks according to their active grade.
  arXiv  Detail & Related papers  (2022-09-19T07:48:28Z)
• Enhancing Local Geometry Learning for 3D Point Cloud via Decoupling Convolution [10.449455311881398]
  We propose Laplacian Unit (LU) as a simple yet effective architectural unit that can enhance the learning of local geometry. LU achieves competitive or superior performance on typical point cloud understanding tasks.
  arXiv  Detail & Related papers  (2022-07-04T03:49:13Z)
• A Unifying and Canonical Description of Measure-Preserving Diffusions [60.59592461429012]
  A complete recipe of measure-preserving diffusions in Euclidean space was recently derived unifying several MCMC algorithms into a single framework. We develop a geometric theory that improves and generalises this construction to any manifold.
  arXiv  Detail & Related papers  (2021-05-06T17:36:55Z)
• GELATO: Geometrically Enriched Latent Model for Offline Reinforcement Learning [54.291331971813364]
  offline reinforcement learning approaches can be divided into proximal and uncertainty-aware methods. In this work, we demonstrate the benefit of combining the two in a latent variational model. Our proposed metrics measure both the quality of out of distribution samples as well as the discrepancy of examples in the data.
  arXiv  Detail & Related papers  (2021-02-22T19:42:40Z)

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.