法线特征约束的激光点云精确配准

Accurate Registration of Laser Point Cloud Based on Normal Feature Constraint

  • 摘要: 作为点云数据处理的关键步骤,配准结果直接影响到后续数据处理的精度。针对传统迭代最近点(iterative closest point,ICP)算法依赖较好初始位置的局限性,提出基于法线特征约束的点云精确配准方法。首先采用局部表面拟合方法进行法线估计,并计算其快速点特征直方图,然后通过采样一致性方法对两组点云进行粗配准,最后通过建立KD‐Tree加快对应点的搜索效率,并设定阈值去除错误对应点对,实现精确配准。结果表明,基于法线特征约束的粗配准算法可以为待配准点云提供较好的初始位置,并且改进的ICP算法有效地提高了点云配准的精度和效率。

     

    Abstract: As one of the core steps in point cloud data processing, the registration result affects on the accuracy of subsequent data processing directly. In view of the limitation of the traditional iterative closest point (ICP) algorithm relying on a better initial position, the accurate registration algorithm based on normal features is studied. Firstly, the local surface fitting method is used to estimate the normal vector of point cloud, and to calculate the fast point feature histograms. Secondly, the sampling consistency algorithm is used to perform the coarse registration of point cloud. Finally, the KD-Tree is built to speed up the search efficiency of the corresponding points, and the normal vector threshold is set to remove corresponding error points. Results show that the coarse registration algorithm based on the normal features can provide a better initial position, and the improved ICP algorithm improves the efficiency and accuracy of registration.

     

/

返回文章
返回