A Moment Matching-Based Method for Sparse and Noisy Point Cloud Registration

• URL: http://arxiv.org/abs/2508.02187v1
• Date: Mon, 04 Aug 2025 08:31:53 GMT
• Title: A Moment Matching-Based Method for Sparse and Noisy Point Cloud Registration
• Authors: Xingyi Li, Han Zhang, Ziliang Wang, Yukai Yang, Weidong Chen,
• Abstract summary: We propose a registration framework based on moment matching.<n>Experiments on synthetic and real-world datasets show that our approach achieves higher accuracy and robustness than existing methods.<n>The proposed method significantly improves the localization performance and achieves results comparable to LiDAR-based systems.
• Score: 8.121132773789652
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Point cloud registration is a key step in robotic perception tasks, such as Simultaneous Localization and Mapping (SLAM). It is especially challenging in conditions with sparse points and heavy noise. Traditional registration methods, such as Iterative Closest Point (ICP) and Normal Distributions Transform (NDT), often have difficulties in achieving a robust and accurate alignment under these conditions. In this paper, we propose a registration framework based on moment matching. In particular, the point clouds are regarded as i.i.d. samples drawn from the same distribution observed in the source and target frames. We then match the generalized Gaussian Radial Basis moments calculated from the point clouds to estimate the rigid transformation between two frames. Moreover, such method does not require explicit point-to-point correspondences among the point clouds. We further show the consistency of the proposed method. Experiments on synthetic and real-world datasets show that our approach achieves higher accuracy and robustness than existing methods. In addition, we integrate our framework into a 4D Radar SLAM system. The proposed method significantly improves the localization performance and achieves results comparable to LiDAR-based systems. These findings demonstrate the potential of moment matching technique for robust point cloud registration in sparse and noisy scenarios.

Related papers

• PKSS-Align: Robust Point Cloud Registration on Pre-Kendall Shape Space [15.151282762403305]
  The proposed method measures shape-based similarity between point clouds on the Pre-Kendall shape space (PKSS), textcolorblackwhich is a shape measurement-based scheme and doesn't require point-to-point or point-to-plane metric.<n>Based on a simple parallel acceleration, it can achieve significant improvement for efficiency and feasibility in practice.
  arXiv  Detail & Related papers  (2025-08-06T10:17:42Z)
• Fully-Geometric Cross-Attention for Point Cloud Registration [51.865371511201765]
  Point cloud registration approaches often fail when the overlap between point clouds is low due to noisy point correspondences.<n>This work introduces a novel cross-attention mechanism tailored for Transformer-based architectures that tackles this problem.<n>We integrate the Gromov-Wasserstein distance into the cross-attention formulation to jointly compute distances between points across different point clouds.<n>At the point level, we also devise a self-attention mechanism that aggregates the local geometric structure information into point features for fine matching.
  arXiv  Detail & Related papers  (2025-02-12T10:44:36Z)
• EADReg: Probabilistic Correspondence Generation with Efficient Autoregressive Diffusion Model for Outdoor Point Cloud Registration [22.084204833166982]
  We propose a novel framework named EADReg for efficient and robust registration of LiDAR point clouds. We employ a Bi-directional Gaussian Mixture Model (BGMM) to reject outlier points and obtain purified point cloud pairs. In the fine stage, we treat diffusion-based PCR as an autoregressive process to generate robust point correspondences.
  arXiv  Detail & Related papers  (2024-11-22T13:03:54Z)
• Inferring Neural Signed Distance Functions by Overfitting on Single Noisy Point Clouds through Finetuning Data-Driven based Priors [53.6277160912059]
  We propose a method to promote pros of data-driven based and overfitting-based methods for better generalization, faster inference, and higher accuracy in learning neural SDFs. We introduce a novel statistical reasoning algorithm in local regions which is able to finetune data-driven based priors without signed distance supervision, clean point cloud, or point normals.
  arXiv  Detail & Related papers  (2024-10-25T16:48:44Z)
• A Consistency-Aware Spot-Guided Transformer for Versatile and Hierarchical Point Cloud Registration [9.609585217048664]
  We develop a consistency-aware spot-guided Transformer (CAST) CAST incorporates a spot-guided cross-attention module to avoid interfering with irrelevant areas. A lightweight fine matching module for both sparse keypoints and dense features can estimate the transformation accurately.
  arXiv  Detail & Related papers  (2024-10-14T08:48:25Z)
• Multiway Point Cloud Mosaicking with Diffusion and Global Optimization [74.3802812773891]
  We introduce a novel framework for multiway point cloud mosaicking (named Wednesday) At the core of our approach is ODIN, a learned pairwise registration algorithm that identifies overlaps and refines attention scores. Tested on four diverse, large-scale datasets, our method state-of-the-art pairwise and rotation registration results by a large margin on all benchmarks.
  arXiv  Detail & Related papers  (2024-03-30T17:29:13Z)
• Implicit neural representation for change detection [15.741202788959075]
  Most commonly used approaches to detecting changes in point clouds are based on supervised methods. We propose an unsupervised approach that comprises two components: Implicit Neural Representation (INR) for continuous shape reconstruction and a Gaussian Mixture Model for categorising changes. We apply our method to a benchmark dataset comprising simulated LiDAR point clouds for urban sprawling.
  arXiv  Detail & Related papers  (2023-07-28T09:26:00Z)
• Overlap-guided Gaussian Mixture Models for Point Cloud Registration [61.250516170418784]
  Probabilistic 3D point cloud registration methods have shown competitive performance in overcoming noise, outliers, and density variations. This paper proposes a novel overlap-guided probabilistic registration approach that computes the optimal transformation from matched Gaussian Mixture Model (GMM) parameters.
  arXiv  Detail & Related papers  (2022-10-17T08:02:33Z)
• LiDAR Point--to--point Correspondences for Rigorous Registration of Kinematic Scanning in Dynamic Networks [0.0]
  We propose a novel trajectory adjustment procedure to improve the registration of LiDAR point clouds. We describe the method for selecting correspondences and how they are inserted into the Dynamic Network as new observation models. We then describe the experiments conducted to evaluate the performance of the proposed framework in practical airborne laser scanning scenarios with low-cost MEMS inertial sensors.
  arXiv  Detail & Related papers  (2022-01-03T11:53:55Z)
• Fast and Robust Registration of Partially Overlapping Point Clouds [5.073765501263891]
  Real-time registration of partially overlapping point clouds has emerging applications in cooperative perception for autonomous vehicles. Relative translation between point clouds in these applications is higher than in traditional SLAM and odometry applications. We propose a novel registration method for partially overlapping point clouds where correspondences are learned using an efficient point-wise feature encoder.
  arXiv  Detail & Related papers  (2021-12-18T12:39:05Z)
• PU-Flow: a Point Cloud Upsampling Networkwith Normalizing Flows [58.96306192736593]
  We present PU-Flow, which incorporates normalizing flows and feature techniques to produce dense points uniformly distributed on the underlying surface. Specifically, we formulate the upsampling process as point in a latent space, where the weights are adaptively learned from local geometric context. We show that our method outperforms state-of-the-art deep learning-based approaches in terms of reconstruction quality, proximity-to-surface accuracy, and computation efficiency.
  arXiv  Detail & Related papers  (2021-07-13T07:45:48Z)
• Deep Magnification-Flexible Upsampling over 3D Point Clouds [103.09504572409449]
  We propose a novel end-to-end learning-based framework to generate dense point clouds. We first formulate the problem explicitly, which boils down to determining the weights and high-order approximation errors. Then, we design a lightweight neural network to adaptively learn unified and sorted weights as well as the high-order refinements.
  arXiv  Detail & Related papers  (2020-11-25T14:00:18Z)

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.