Fast and Robust Iterative Closest Point
arXiv:2007.07627 · doi:10.1109/TPAMI.2021.3054619
Abstract
The Iterative Closest Point (ICP) algorithm and its variants are a fundamental technique for rigid registration between two point sets, with wide applications in different areas from robotics to 3D reconstruction. The main drawbacks for ICP are its slow convergence as well as its sensitivity to outliers, missing data, and partial overlaps. Recent work such as Sparse ICP achieves robustness via sparsity optimization at the cost of computational speed. In this paper, we propose a new method for robust registration with fast convergence. First, we show that the classical point-to-point ICP can be treated as a majorization-minimization (MM) algorithm, and propose an Anderson acceleration approach to speed up its convergence. In addition, we introduce a robust error metric based on the Welsch's function, which is minimized efficiently using the MM algorithm with Anderson acceleration. On challenging datasets with noises and partial overlaps, we achieve similar or better accuracy than Sparse ICP while being at least an order of magnitude faster. Finally, we extend the robust formulation to point-to-plane ICP, and solve the resulting problem using a similar Anderson-accelerated MM strategy. Our robust ICP methods improve the registration accuracy on benchmark datasets while being competitive in computational time.
Cited by in corpus (16)
- KSS-ICP: Point Cloud Registration based on Kendall Shape Space
- Point Cloud Registration for LiDAR and Photogrammetric Data: a Critical Synthesis and Performance Analysis on Classic and Deep Learning Algorithms
- GDRNPP: A Geometry-guided and Fully Learning-based Object Pose Estimator
- LPRnet: A self-supervised registration network for LiDAR and photogrammetric point clouds
- 3DEG: Data-Driven Descriptor Extraction for Global re-localization in subterranean environments
- MICP-L: Mesh-based ICP for Robot Localization using Hardware-Accelerated Ray Casting
- Fast Gravitational Approach for Rigid Point Set Registration with Ordinary Differential Equations
- End-to-end Surface Optimization for Light Control
- A Conditional Point Cloud Diffusion Model for Deformable Liver Motion Tracking Via a Single Arbitrarily-Angled X-ray Projection
- Piecewise Ruled Approximation for Freeform Mesh Surfaces
- Large-scale DSM registration via motion averaging
- Pose Estimation of Buried Deep-Sea Objects using 3D Vision Deep Learning Models
- A Direct Semi-Exhaustive Search Method for Robust, Partial-to-Full Point Cloud Registration
- A Robust Loss for Point Cloud Registration
- Cross-Session 3D LiDAR and Camera Fusion for Robust Localization of Unmanned Aerial Vehicles in GPS-Denied Environments
- A volumetric change detection framework using UAV oblique photogrammetry - A case study of ultra-high-resolution monitoring of progressive building collapse