基于M样本一致性-广义迭代最近点融合的点云配准方法研究

Research on point cloud registration method based on M-sample consistency-generalized iterative nearest point fusion

  • 摘要: 针对传统点云配准方法对初始位姿依赖强、易陷入局部最优以及配准精度受限的问题,文章提出一种基于MSAC与GICP融合的点云配准方法。首先,利用M估计样本一致性算法(M-estimator sample consensus, MSAC)进行粗配准,有效去除离群点干扰并获得初步变换矩阵;其次,采用广义迭代最近点(generalized iterative closest point, GICP)算法进行精配准,通过融合点云法线与协方差信息优化点对匹配,缩短了配准时间和提升了配准精度,鲁棒性得到了提高;最后,对扫描后三通管点云数据进行配准实验。实验结果表明,该方法在不同方向条件下均能实现高精度配准。MSAC-GICP算法相较于传统最近点算法(iterative closest points, ICP)在误差控制与稳定性方面均有显著优势,与FPFH-RANSAC(fast point feature histograms-random sample consensus)、RANSAC-GICP(random sample consensus-generalized iterative closest point)算法相比配准精度均提升,配准时间均缩短,配准稳定性得到了提升,证明该配准算法的可行性。

     

    Abstract: To address the limitations of traditional point cloud registration methods, such as strong dependence on initial poses, susceptibility to local optima, and constrained registration accuracy, a point cloud registration approach integrating MSAC and GICP is proposed. Firstly, the M-estimator sample consensus (MSAC) algorithm performs coarse registration to effectively remove outlier interference and obtain a preliminary transformation matrix. Subsequently, the generalized iterative closest point (GICP) algorithm is employed for fine registration. By integrating point cloud normals and covariance information, it optimized point pair matching, reduced registration time and improved accuracy, while enhancing robustness. Finally, registration experiments are conducted on post-scanning tee pipe point cloud data. Experimental results demonstrate that this method achieves high-precision registration under various orientation conditions. Compared to traditional ICP methods, the MSAC-GICP algorithm demonstrates significant advantages in error control and stability. When compared to the FPFH-RANSAC and RANSAC-GICP algorithms, it achieves higher registration accuracy, reduced registration time, and enhanced registration stability, proving the feasibility of this registration algorithm.

     

/

返回文章
返回