检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:涂志强[1] 张轲[1] 杨成龙 朱晓鹏[1] 黄洁[1]
机构地区:[1]上海交通大学上海市激光制造与材料改性重点实验室,上海200240 [2]大连船舶重工集团有限公司,大连116005
出 处:《焊接学报》2013年第1期97-100,118,共4页Transactions of The China Welding Institution
基 金:国家自然科学基金资助项目(50605044);国家科技部资助项目(2009DFB50350)
摘 要:提出一种以不同视野下的点云为处理对象,自动进行点云配准的拼接算法.该算法首先利用点云的曲率、法矢量等几何信息,计算出初次拼接变换,并用几何哈希的方法筛选出最优的变换,完成初次拼接.然后改进最近点迭代法(iterative closest point,ICP)中最近点的选取方法:对点云A中的测点,先求出另一点云B中与其最近的3个点,并由这3个点构成一个三角形,把测点到三角形的垂足作为测点的最近点.并用该算法对点云进行再次拼接.最后基于该算法实现了对车头模型的配准.结果表明,该算法具有较高的配准精度.One algorithm to automatically register point cloud data in 3-D model reconstruction was proposed.In the algorithm,the initial registration transformations were firstly calculated according to the curvature and normal vector of the point cloud.Then the best initial registration transformation was selected by geometric hashing method and the initial registration was completed by this transformation.Next,the ICP(iterative closest point) algorithm was improved by redefining the nearest point: For one measured point of A,the nearest three points in B point cloud were firstly found;the triangle was formed by this three points and the foot point of this triangle was taken as nearest point of measured point.Then the improved ICP algorithm was used for accurate secondary registration.Finally,this algorithm was used to register the point data in previous model.And the results show this algorithm has the better performance in registration accuracy.
分 类 号:TH166[机械工程—机械制造及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.166