基于区间分割和兼容加权的点云配准算法

Point cloud registration algorithm based on interval segmentation and compatibility weighting

  • 摘要: 针对重叠区域小、共享的特征点较少的点云存在配准精度不高的问题,提出一种基于区间分割和兼容加权的点云配准算法。该算法利用距离分割将点云划分为多个子区间,并通过构建子区间的特征描述符求取其直方图相似度,从而确定子区间的对应关系。引入可信性和一致性约束,求解刚体变换组合系数,从局部配准得到全局配准,从而实现点云粗配准。最后基于尺度不变相容约束进行双点采样,并计算对应点对的兼容性权重矩阵,对其进行投票后排序,求得共识最大化的刚体变换,完成点云精配准。实验采用斯坦福点云数据模型、3DMatch室内场景数据模型以及农田点云数据模型进行验证,结果表明,对比6种配准算法,所提算法具有最高的配准精度和最低的配准耗时。在斯坦福点云数据的配准中,所提算法在平均精度上均提高了10%以上,平均耗时均降低了14%以上;在室内场景的点云配准中,所提算法在平均精度上均提高了20%以上,平均耗时均降低了14%以上;在农田点云数据配准中,所提算法在平均精度上均提高了21%以上,平均耗时均降低了16%以上,因此可以说该基于区间分割和兼容加权的点云配准算法是一种高效的点云配准算法。

     

    Abstract: Aiming at the problem of low registration accuracy of point clouds with small overlapping areas and few shared feature points, a point cloud registration algorithm based on interval segmentation and compatible weighting is proposed. In this algorithm, the point cloud is divided into several sub-intervals by distance segmentation, and the histogram similarity is obtained by constructing the feature descriptors of the sub-intervals, so as to determine the corresponding relationship of the sub-intervals. By introducing credibility and consistency constraints, the combination coefficients of rigid body transformation are solved, and the global registration is obtained from local registration, thereby achieving the coarse registration of point cloud. Finally, two-point sampling is carried out based on the scale invariant compatibility constraint, the compatibility weight matrix of corresponding point pairs is calculated, the rigid body transformation with maximum consensus is obtained after voting, and the fine registration of point cloud is completed. Stanford point cloud data model, 3DMatch indoor scene data model and the farmland point cloud data model are used to verify the experiment. The results show that compared with the six registration algorithms, the proposed algorithm has the highest registration accuracy and the lowest registration time consumption. In the registration of Stanford point cloud data, the average accuracy of the proposed algorithm is improved by more than 10%, and the average time consumption is reduced by more than 14%. In the point cloud registration of indoor scenes, the average accuracy of the proposed algorithm is improved by more than 20%, and the average time consumption is reduced by more than 14%. In the registration of farmland point cloud data, the proposed algorithm has increased the average accuracy by more than 21% and reduced the average time consumption by more than 16%. Therefore, it can be said that the point cloud registration algorithm based on interval segmentation and compatible weighting is an efficient point cloud registration algorithm.

     

/

返回文章
返回