杨秋翔, 安雁艳, 杨剑. 基于单位四元数的ICP改进算法[J]. 微电子学与计算机, 2016, 33(3): 111-115.
引用本文: 杨秋翔, 安雁艳, 杨剑. 基于单位四元数的ICP改进算法[J]. 微电子学与计算机, 2016, 33(3): 111-115.
YANG Qiu-xiang, AN Yan-yan, YANG Jian. Improved Algorithm of Iterative Closest Point Based on the Unit Quaternion[J]. Microelectronics & Computer, 2016, 33(3): 111-115.
Citation: YANG Qiu-xiang, AN Yan-yan, YANG Jian. Improved Algorithm of Iterative Closest Point Based on the Unit Quaternion[J]. Microelectronics & Computer, 2016, 33(3): 111-115.

基于单位四元数的ICP改进算法

Improved Algorithm of Iterative Closest Point Based on the Unit Quaternion

  • 摘要: 针对三维点云数据配准过程中最近点搜索效率和配准精度差的问题, 提出一种基于单位四元数的ICP改进算法.首先, 采用扩展方向可控的二次栅格化点云数据的策略搜索最近点对; 然后根据所得对应点对求取参考点云和待配准点云间的变换矩阵; 最后依据变换矩阵实现点云数据的配准.实验结果表明, 所提算法在配准时间和配准精度上均有一定程度的提高, 证明该算法是有效可行的.

     

    Abstract: Concerned the problem of the closet search efficiency and registration accuracy difference in the process of three-dimensional point data registration, an improved algorithm of iterative closest point based on the unit quaternion is presented. At first, pairs of closet point are searched by using a strategy whose direction can be controlled for finding nearest neighbors of secondary rasterizing point cloud data. Then calculate the transformation matrix between reference point clouds and registration point clouds on the basis of pairs of closet point. Finally, on the basis of transformation matrix point cloud data registration is implemented. Simulated experiments showed that the provided algorithm could reduce registration time and increase registration accuracy to a certain degree which indicates that it could be more effective and feasible.

     

/

返回文章
返回