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

• URL: http://arxiv.org/abs/2302.01109v1
• Date: Thu, 2 Feb 2023 14:06:46 GMT
• Title: GraphReg: Dynamical Point Cloud Registration with Geometry-aware Graph Signal Processing
• Authors: Zhao Mingyang, Ma Lei, Jia Xiaohong, Yan Dong-Ming, and Huang Tiejun
• Abstract summary: This study presents a high-accuracy, efficient, and physically induced method for 3D point cloud registration. We explore geometry aware rigid-body dynamics to regulate the particle (point) motion, which results in more precise and robust registration. Results demonstrate that our proposed method outperforms state-of-the-art approaches in terms of accuracy and is more suitable for registering large-scale point clouds.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Micro-Structures Graph-Based Point Cloud Registration for Balancing Efficiency and Accuracy [5.70403503863614]
  We propose a novel micro-structures graph-based global point cloud registration method. Our proposed method performs well on the 3DMatch and ETH datasets.
  arXiv  Detail & Related papers  (2024-10-29T08:36:23Z)
• SPARE: Symmetrized Point-to-Plane Distance for Robust Non-Rigid Registration [76.40993825836222]
  We propose SPARE, a novel formulation that utilizes a symmetrized point-to-plane distance for robust non-rigid registration. The proposed method greatly improves the accuracy of non-rigid registration problems and maintains relatively high solution efficiency.
  arXiv  Detail & Related papers  (2024-05-30T15:55:04Z)
• PointDifformer: Robust Point Cloud Registration With Neural Diffusion and Transformer [31.02661827570958]
  Point cloud registration is a fundamental technique in 3-D computer vision with applications in graphics, autonomous driving, and robotics. We propose a robust point cloud registration approach that leverages graph neural partial differential equations (PDEs) and heat kernel signatures. Empirical experiments on a 3-D point cloud dataset demonstrate that our approach not only achieves state-of-the-art performance for point cloud registration but also exhibits better robustness to additive noise or 3-D shape perturbations.
  arXiv  Detail & Related papers  (2024-04-22T09:50:12Z)
• Robust-DefReg: A Robust Deformable Point Cloud Registration Method based on Graph Convolutional Neural Networks [0.0]
  This paper introduces Robust-DefReg, a robust non-rigid point cloud registration method based on graph convolutional networks (GCNNs) The proposed method achieves high accuracy in large deformations while maintaining computational efficiency.
  arXiv  Detail & Related papers  (2023-06-07T18:08:11Z)
• 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)
• An Efficient Hypergraph Approach to Robust Point Cloud Resampling [57.49817398852218]
  This work investigates point cloud resampling based on hypergraph signal processing (HGSP) We design hypergraph spectral filters to capture multi-lateral interactions among the signal nodes of point clouds. Our test results validate the high efficacy of hypergraph characterization of point clouds.
  arXiv  Detail & Related papers  (2021-03-11T23:19:54Z)
• Self-supervised Geometric Perception [96.89966337518854]
  Self-supervised geometric perception is a framework to learn a feature descriptor for correspondence matching without any ground-truth geometric model labels. We show that SGP achieves state-of-the-art performance that is on-par or superior to the supervised oracles trained using ground-truth labels.
  arXiv  Detail & Related papers  (2021-03-04T15:34:43Z)
• Canny-VO: Visual Odometry with RGB-D Cameras based on Geometric 3D-2D Edge Alignment [85.32080531133799]
  This paper reviews the classical problem of free-form curve registration and applies it to an efficient RGBD visual odometry system called Canny-VO. Two replacements for the distance transformation commonly used in edge registration are proposed: Approximate Nearest Neighbour Fields and Oriented Nearest Neighbour Fields. 3D2D edge alignment benefits from these alternative formulations in terms of both efficiency and accuracy.
  arXiv  Detail & Related papers  (2020-12-15T11:42:17Z)
• 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)
• Hypergraph Spectral Analysis and Processing in 3D Point Cloud [80.25162983501308]
  3D point clouds have become a fundamental data structure to characterize 3D objects and surroundings. To process 3D point clouds efficiently, a suitable model for the underlying structure and outlier noises is always critical. We propose a hypergraph-based new point cloud model that is amenable to efficient analysis and processing.
  arXiv  Detail & Related papers  (2020-01-08T05:30:16Z)

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.