文件名称:laser-kinect-pointcloud-register-icp
-
所属分类:
- 标签属性:
- 上传时间:2016-08-01
-
文件大小:3.88mb
-
已下载:1次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
针对三维重建中的点云配准问题,提出一种基于点云特征的自动配准算法。利用微软Kinect传感器采集物
体的多视角深度图像,提取目标区域并转化为三维点云。对点云进行滤波并估计快速点特征直方图特征,结合双向
快速近似最近邻搜索算法得到初始对应点集,并使用随机采样一致性算法确定最终对应点集。根据奇异值分解法
求出点云的变换矩阵初始值,在初始配准的基础上运用迭代最近点算法做精细配准。实验结果表明,该配准方法既
保证了三维点云的配准质量,又降低了计算复杂度,具有较高的可操作性和鲁棒性。
-Aiming at the problem of point cloud registration in 3D reconstruction, this paper presents an automatic regis-
tration method based on the feature of point cloud. Firstly, it utilizes Microsoft Kinect sensor to capture depth images in
several different views and the interest regions are extracted and converted to 3D point cloud. Secondly, point clouds are
filtered and the fast point feature histograms are estimated, then the bidirectional fast approximate nearest neighbor algorithm
and random sample consensus are employed to search the final corresponding points. Finally, after computing the initial
transformation matric applying singular value decomposition, the iterative closest point algorithm is used to get refined
result on the base of initial registration. Experiments show that this registration method can not only ensure the quality of
point cloud registration, but reduce the computation complexity, and achieve higher maneuverability and better robustness.
体的多视角深度图像,提取目标区域并转化为三维点云。对点云进行滤波并估计快速点特征直方图特征,结合双向
快速近似最近邻搜索算法得到初始对应点集,并使用随机采样一致性算法确定最终对应点集。根据奇异值分解法
求出点云的变换矩阵初始值,在初始配准的基础上运用迭代最近点算法做精细配准。实验结果表明,该配准方法既
保证了三维点云的配准质量,又降低了计算复杂度,具有较高的可操作性和鲁棒性。
-Aiming at the problem of point cloud registration in 3D reconstruction, this paper presents an automatic regis-
tration method based on the feature of point cloud. Firstly, it utilizes Microsoft Kinect sensor to capture depth images in
several different views and the interest regions are extracted and converted to 3D point cloud. Secondly, point clouds are
filtered and the fast point feature histograms are estimated, then the bidirectional fast approximate nearest neighbor algorithm
and random sample consensus are employed to search the final corresponding points. Finally, after computing the initial
transformation matric applying singular value decomposition, the iterative closest point algorithm is used to get refined
result on the base of initial registration. Experiments show that this registration method can not only ensure the quality of
point cloud registration, but reduce the computation complexity, and achieve higher maneuverability and better robustness.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
利用Kinect深度信息的三维点云配准方法研究_王欢.caj
激光雷达点云特征分析与数据分割_李恒星.caj
激光雷达点云特征分析与数据分割_李恒星.caj
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.