首页 | 本学科首页   官方微博 | 高级检索  
     

一种应用于大角度变换点云的配准方法
作者姓名:李 健  杨静茹  何 斌
作者单位:1. 陕西科技大学电气与信息工程学院,陕西 西安 710021; 2. 同济大学电子与信息工程学院,上海 201804
基金项目:国家自然科学基金项目(51538009);陕西省工业攻关项目(2015GY044)
摘    要:针对传统配准法不能很好解决大角度变换点云的配准这一问题,提出一种基于精 确对应特征点对及其 K 邻域点云的配准方法。首先分别计算两组点云的 FPFH 值,根据特征值 建立点云间的对应关系;然后通过 RANSAC 滤除其中错误的匹配点对,得到相对精确的特征点 对集合;之后通过 KD-tree 搜索的方式分别找出特征点对 R 半径邻域内的点,应用 ICP 算法得 到两部分点云的最优收敛;最后将计算得到的相对位置关系应用到原始点云上得到配准结果。 通过对斯坦福大学点云库中 Dragon、Happy Buddha 模型以及 Kinect 采集的石膏像数据进行配 准和比较,实验表明该方法能够有效解决大角度变换点云的配准问题,是一种具有高精度和高 鲁棒性的三维点云配准方法。

关 键 词:点云配准  快速点特征直方图  随机采样一致  迭代最近点  KD-Tree  

A Registration Method for Large-Angle PointClouds
Authors:LI Jian  YANG Jingru  HE Bin
Affiliation:1. School of Electrical and Information Engineering, Shaanxi University of Science & Technology, Xi’an Shaanxi 710021, China;2. School of Electronics and Information Engineering, Tongji University, Shanghai 201804, China
Abstract:To the problem of traditional registration algorithm are difficult to get the desired effect in large-angle pointcloud registration. We proposed a registration method based on exact correspondence feature point pairs and its K-neighbour pointclouds. Firstly, calculate the FPFH of the pointclouds separately, establishing correspondences between point clouds According to the eigenvalues; Then remove the erroneous matching point pairs by RANSAC, and obtain a relatively accurate set of feature point pairs; Moreover, using KD-tree search get the R-Rad region of the feature point pairs respectively, and applying ICP to obtain the optimal convergence of pointclouds. Finally, applying the ICP relative position relationship to the original pointclouds to get the final registration result. Through registration testing and comparison of the Stanford Dragon, Happy Buddha pointcloud models, and Gypsum data scanned by Kinect, The experiment shows that this method can effectively solve the registration problem of pointclouds with large angle transformation, its a 3D pointclouds registration method with high accuracy and robustness.
Keywords:pointcloud registration  fast point feature histograms  random sample consensus  iterative closest point  KD-tree  
本文献已被 CNKI 等数据库收录!
点击此处可从《》浏览原始摘要信息
点击此处可从《》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号