激光与光电子学进展, 2019, 56 (22): 221504, 网络出版: 2019-11-02   

基于相关系数平方和最大的三维点云配准 下载: 972次

Three-Dimensional Point Cloud Registration Based on Maximum Sum of Squares of Correlation Coefficients
作者单位
成都理工大学核技术与自动化工程学院, 四川 成都 610059
摘要
点云配准是三维重建过程的核心问题之一。针对点云散乱、数据存在缺失及噪声干扰情况下配准效率差、精度低的问题,提出了一种基于相关系数平方和最大(MCC)的点云配准算法。分别对目标点云与待配准点云去均值化后进行旋转,使旋转后的两组点云各自满足行向量间相关系数平方和最大;再利用粒子群优化算法分别求解出两组中间态旋转矩阵;最后根据两组中间态旋转矩阵求解出两点云之间的旋转矩阵和平移向量,进而实现点云配准。仿真结果表明,在点云散乱、数据存在缺失以及噪声干扰的情况下,本文算法比现有其他算法的配准速度更快、精度更高,且稳健性良好。
Abstract
Point cloud registration is a fundamental element of the three-dimensional reconstruction processes. In this study, a point cloud registration algorithm is proposed based on the maximum sum of squares of the correlation coefficients (MCC) to address the issues of scattered point clouds, missing data, and low registration efficiency and accuracy under noise interference. Further, the target point cloud and the point cloud to be registered are de-averaged and rotated, so that the MCC between row vectors of the two sets of point clouds can be achieved after rotation. Subsequently, particle swarm optimization algorithm is used to derive two sets of intermediate-state rotation matrices. Finally, based on these matrix sets, the rotation matrix and translation vector between two point clouds are obtained for registering the point cloud. The simulation results show that the proposed algorithm is faster, more accurate, and more robust compared with the remaining existing algorithms when point clouds are scattered, missing, and interrupted by noise.

苗长伟, 唐志荣, 唐英杰. 基于相关系数平方和最大的三维点云配准[J]. 激光与光电子学进展, 2019, 56(22): 221504. Changwei Miao, Zhirong Tang, Yingjie Tang. Three-Dimensional Point Cloud Registration Based on Maximum Sum of Squares of Correlation Coefficients[J]. Laser & Optoelectronics Progress, 2019, 56(22): 221504.

本文已被 2 篇论文引用
被引统计数据来源于中国光学期刊网
引用该论文: TXT   |   EndNote

相关论文

加载中...

关于本站 Cookie 的使用提示

中国光学期刊网使用基于 cookie 的技术来更好地为您提供各项服务,点击此处了解我们的隐私策略。 如您需继续使用本网站,请您授权我们使用本地 cookie 来保存部分信息。
全站搜索
您最值得信赖的光电行业旗舰网络服务平台!