基于快速鲁棒-最近点迭代算法的构件点云配准方法

Component point cloud registration method based on fast and robust-iterative closest point algorithm

  • 摘要: 大型构件的原位加工模式对加工设备的定位精度提出了很高的要求。传统的最近点迭代(iterative closest point,ICP)算法在源点云和目标点云初始位姿相差较大时容易导致配准失败,在噪声环境下鲁棒性差容易导致错误匹配。针对以上问题提出一种基于快速鲁棒-最近点迭代(fast and robust-iterative closest point,FR-ICP)算法的构件点云配准方法。对斯坦福数据集和构件点云进行体素下采样,基于内蕴形状特征(intrinsic shape signatures,ISS)提取关键点并计算快速点特征直方图(fast point feature histograms,FPFH)特征描述子,基于随机采样一致性(random sample consensus,RANSAC)算法对点云进行粗配准。对点到面的ICP算法进行改进,引入Tukey鲁棒函数,对点云进行精配准。实验证明,改进后的算法能够有效提高噪声环境下点云配准的鲁棒性、收敛速度和精度以及在有噪声且初始位姿差异较大时的配准成功率。

     

    Abstract: The in-situ processing mode of large components places very high requirements on the positioning accuracy of the processing equipment. The traditional iterative closest point (ICP) algorithm is prone to fail in registration when the initial poses of the source point cloud and the target point cloud are significantly different and has poor robustness in noisy environments, which may lead to incorrect matching. To address these issues, a component point cloud registration method based on the fast and robust-iterative closest point (FR-ICP) algorithm is proposed. The Stanford dataset and component point clouds are voxelally downsampled, key points are extracted based on intrinsic shape signatures (ISS), and the fast point feature histograms (FPFH) feature descriptors are calculated. The point cloud is coarsely registered using the random sample consensus (RANSAC) algorithm. The ICP algorithm from point-to-plane is improved by introducing the Tukey robust function, and the point cloud is finely registered. Experiments have shown that the improved algorithm can effectively enhance the robustness, convergence speed, and accuracy of point cloud registration in noisy environments as well as the registration success rate when there is noise and a significant initial pose difference.

     

/

返回文章
返回