基于八叉树与3D-SIFT特征提取的点云配准算法

Point cloud registration algorithm based on octree and 3D-SIFT feature extraction

  • 摘要: 增材制造拓扑构型件的三维检测在后处理中至关重要,拓扑构型件的表面几何形状不规则,结构上分布有大量孔洞,现有三维检测方法在配准拓扑构型件点云时,会出现配准效率低下和产生误匹配等问题,对此,提出了一种基于八叉树与3D-SIFT特征提取的点云配准算法。首先,对点云数据进行统计滤波预处理,然后采用八叉树采样和3D-SIFT相结合提取特征点,最大程度地保留点云原始特征;引入相对相异度向量改进SAC-IA粗配准算法,预先排除差异大的点对;最后,使用结合双向KD-tree与Welsch函数改进的ICP算法进行精配准。在斯坦福大学公共点云配准实验中,相比于RANSAC+ICP、SAC-IA+ICP、ISS+3DSC+NDT等算法,本文所提算法的平均误差分别减少了约84.8%、69.5%和54.7%,配准耗时分别减少约86.7%、78.1%和58.2%,在扫描拓扑构型件点云配准实验中,均方根误差为0.0612 mm,配准耗时为7.97 s。实验结果表明:本文算法能有效提高点云配准的准确性和效率,适用于数据量大、结构复杂的拓扑构型件点云配准,为提高后处理效果奠定了基础。

     

    Abstract: The 3D detection of topological configuration components of additive manufacturing is crucial in post-processing. Topological configuration components have irregular surface geometry and a large number of holes distributed on the structure. Problems such as low registration efficiency and mismatching may occur when registering topological configuration component point clouds with existing 3D detection methods. A point cloud registration algorithm based on octree and 3D-SIFT feature extraction is proposed. Firstly, the point cloud data is preprocessed by statistical filtering, and then the feature points are extracted by combining octree sampling and 3D-SIFT to preserve the original features of the point cloud to the greatest extent. The relative dissimilarity vector is introduced to improve SAC-IA rough registration algorithm, and the point pairs with large differences are excluded in advance. Finally, an improved ICP algorithm combining two-way KD-tree and Welsch function is used for fine registration. In the Stanford University public point cloud registration experiment, compared with RANSAC+ICP, SAC-IA+ICP, ISS+3DSC+NDT and other algorithms, the average error is reduced by about 84.8%, 69.5% and 54.7%, respectively, and the registration time is reduced by about 86.7%, 78.1% and 58.2%, respectively. In the point cloud registration experiment of scanning topological structures, the root-mean-square error is 0.0612 mm and the registration time is 7.97 s. The experimental results show that the proposed algorithm can effectively improve the accuracy and efficiency of high point cloud registration, and is suitable for point cloud registration of topological configuration components with large data volume and complex structure, which lays a foundation for improving the post-processing effect.

     

/

返回文章
返回