基于微结构图的点云配准方法,兼顾精度与效率。
Micro-Structures Graph-Based Point Cloud Registration for Balancing Efficiency and Accuracy
- 构建微结构图,分层剔除异常点,提升粗配准鲁棒性
- 在3DMatch和ETH数据集上精度更高,耗时减少三分之一以上
- 适合需要快速高精度配准的三维重建与测绘场景
点云配准(PCR)是摄影测量与遥感中的基础关键问题,旨在寻找点集间的最优刚性变换。实现高效且精确的配准极具挑战。本文提出一种基于微结构图的全局点云配准新方法,分为两个阶段:1)粗配准(CR):构建包含微结构的图,采用高效的图层次策略剔除异常点,获得最大一致集;提出一种源自鲁棒估计器的鲁棒GNC-Welsch估计算法,在李代数空间优化,实现快速稳健对齐;2)精配准(FR):利用八叉树自适应搜索微结构中的平面特征,通过最小化点到平面距离,实现更精确的局部对齐,并结合安德森加速优化(PA-AA)有效求解。在真实数据上的大量实验表明,该方法在3DMatch和ETH数据集上优于最先进方法,精度指标更高,时间成本至少降低三分之一。
原文摘要 · Abstract (English)
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 point cloud registration 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 algorithm combined with Anderson accelerated optimization (PA-AA). 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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。