mlsanityData to 14 Oct 2026

GraphReg: Dynamical Point Cloud Registration with Geometry-aware Graph Signal Processing

arXiv 2302.01109 ↗First posted 2 Feb 2023cs.CVcited by 4

Not on the map. Why?

Abstract (arXiv)

This study presents a high-accuracy, efficient, and physically induced method for 3D point cloud registration, which is the core of many important 3D vision problems. In contrast to existing physics-based methods that merely consider spatial point information and ignore surface geometry, we explore geometry aware rigid-body dynamics to regulate the particle (point) motion, which results in more precise and robust registration. Our proposed method consists of four major modules. First, we leverage the graph signal processing (GSP) framework to define a new signature, (i.e., point response intensity for each point), by which we succeed in describing the local surface variation, resampling keypoints, and distinguishing different particles. Then, to address the shortcomings of current physics-based approaches that are sensitive to outliers, we accommodate the defined point response intensity to median absolute deviation (MAD) in robust statistics and adopt the X84 principle for adaptive outlier depression, ensuring a robust and stable registration. Subsequently, we propose a novel geometric invariant under rigid transformations to incorporate higher-order features of point clouds, which is further embedded for force modeling to guide the correspondence between pairwise scans credibly. Finally, we introduce an adaptive simulated annealing (ASA) method to search for the global optimum and substantially accelerate the registration process. We perform comprehensive experiments to evaluate the proposed method on various datasets captured from range scanners to LiDAR. Results demonstrate that our proposed method outperforms representative state-of-the-art approaches in terms of accuracy and is more suitable for registering large-scale point clouds. Furthermore, it is considerably faster and more robust than most competitors.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 15 of its 63 references that are in the map. First posted on arXiv 2 Feb 2023.

Builds on

15 of 63 references.

References · 15

  1. 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,248
  2. 2017Graph Signal Processing: Overview, Challenges and Applicationscited by 413
  3. 2019Deep Closest Point: Learning Representations for Point Cloud Registrationcited by 321
  4. 2020TEASER: Fast and Certifiable Point Cloud Registrationcited by 274
  5. 2019PointNetLK: Robust & Efficient Point Cloud Registration using PointNetcited by 233
  6. 2020Deep Global Registrationcited by 229
  7. 2020Fast and Robust Iterative Closest Pointcited by 67
  8. 20183D Point Cloud Denoising using Graph Laplacian Regularization of a Low Dimensional Manifold Modelcited by 47
  9. 2018FilterReg: Robust and Efficient Probabilistic Point-Set Registration using Gaussian Filter and Twist Parameterizationcited by 43
  10. 2017Fast Resampling of 3D Point Clouds via Graphscited by 25
  11. 2020Hypergraph Spectral Analysis and Processing in 3D Point Cloudcited by 14
  12. 2020Rigid and Articulated Point Registration with Expectation Conditional Maximizationcited by 11
3 more
  1. 2021LSG-CPD: Coherent Point Drift with Local Surface Geometry for Point Cloud Registrationcited by 11
  2. 2018Eigendecomposition-Free Sampling Set Selection for Graph Signalscited by 9
  3. 2021An Efficient Hypergraph Approach to Robust Point Cloud Resamplingcited by 3

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 2; 2025: 1.

4 papers.