Micro-Structures Graph-Based Point Cloud Registration for Balancing Efficiency and Accuracy

doi:10.1109/TGRS.2024.3488502

2024-01-01

DOI：10.1109/TGRS.2024.3488502

原文链接

原文求助

摘要

En 中文

Point cloud registration (PCR) is a fundamental and significant issue in photogrammetry and remote sensing, aiming to seek the optimal rigid transformation between sets of points. Achieving efficient and precise PCR poses a considerable challenge. We propose a novel micro-structures graph-based global PCR method. The overall method is comprised of two stages. 1) Coarse registration (CR): We develop a graph incorporating micro-structures, employing an efficient graph-based hierarchical strategy to remove outliers for obtaining the maximal consensus set. We propose a robust GNC-Welsch estimator for optimization derived from a robust estimator to the outlier process in the Lie algebra space, achieving fast and robust alignment. 2) Fine registration (FR): To refine local alignment further, we use the octree approach to adaptive search plane features in the micro-structures. By minimizing the distance from the point-to-plane, we can obtain a more precise local alignment, and the process will also be addressed effectively by being treated as a planar adjustment (PA) algorithm combined with Anderson accelerated (PA-AA) optimization. After extensive experiments on real data, our proposed method performs well on the 3DMatch and ETH datasets compared to the most advanced methods, achieving higher accuracy metrics and reducing the time cost by at least one-third.

Keyword:

Anderson acceleration

correspondence graph

planar adjustment (PA)

point cloud registration (PCR)

robust estimator