检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陆尚鸿 李文国[1] LU Shanghong;LI Wenguo(Faculty of Mechanical and Electrical Engineering,Kunming University of Science and Technology,Kunming 650500,China)
机构地区:[1]昆明理工大学机电工程学院,云南昆明650500
出 处:《电子科技》2022年第4期53-59,66,共8页Electronic Science and Technology
基 金:国家自然科学基金(51865020)。
摘 要:点云配准的质量直接影响着三维重建的质量。针对传统K-4PCS耗时长且易出现错误匹配等问题,文中提出一种基于边界质心的点云粗配准方法。通过对点云进行边界提取,既保留点云外表特征,又减少了点云数据的大小,提高了粗配准速度。为了加快边界点的提取速度,使用K-D tree算法完成对k近邻点的搜索。通过配准边界点的质心,减少点云初始距离并增加重叠度,保证了粗配准的精度。实验结果证明,文中方法在粗配准速度和精度方面都优于传统K-4PCS算法,其速度约为传统K-4PCS算法的2倍,平移和旋转精度也比传统K-4PCS高了40%以上。文中所提方法对提高点云粗配准的速度和精度具有一定的参考价值。The quality of point cloud registration directly affects the quality of 3D reconstruction.To solve the problem that the traditional K-4PC is time-consuming and prone to mismatching,a coarse point cloud registration method based on boundary centroid is proposed.By extracting the boundary of the point cloud,the surface features of the point cloud are preserved and the size of the point cloud data is reduced,which improves the speed of coarse registration.In order to speed up the extraction of boundary points,the K-D tree algorithm is used to search for k nearest neighbors.By registering the centroid of the boundary points,the initial distance of the point cloud is reduced and the degree of overlap is increased,ensuring the accuracy of coarse registration.The experimental results show that the proposed method is better than the traditional K-4PCS algorithm in terms of speed and accuracy.The speed of this method is about twice that of traditional K-4PCS.Both the translation and rotation accuracy are 40%higher than that of traditional K-4PCS.The proposed method has certain reference value for improving the speed and accuracy of point cloud coarse registration.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15