Optimized GICP registration algorithm based on principal component analysis for point cloud edge extraction

Author:

Zhao Weidong1,Zhang Dandan1ORCID,Li Dan1,Zhang Yao1,Ling Qiang1

Affiliation:

1. School of Electrical and Information Engineering, Anhui University of Technology, Ma’anshan, China

Abstract

For iterative closest point (ICP) algorithm, the initial position and the number of iterations are needed in registration. At the same time, the ICP algorithm is easy to fall into local convergence and convergence speed is slow. By constructing K-D tree to search neighborhood points and artificially set threshold, plane fitting is carried out, the on-time point cloud to be deployed is separated from the complex background, and statistical analysis is used to calculate the distance between the point cloud and the neighborhood point to quickly remove the invalid point cloud. The surface equation is set to calculate the tangent plane of point cloud normal vector and each normal vector, and the local coordinate system is constructed. The angle between adjacent vectors and the local coordinate system is calculated to determine the feature point set of edge contour. According to the covariance matrix of the feature points set, the principal feature component is obtained, the principal axis direction of the two sets of point clouds is found, and the rotation matrix and the displacement vector are obtained. Finally, GICP precise registration of point cloud is carried out according to initial pose parameters and rigid body transformation matrix obtained by maximum likelihood estimation method. The results show that the optimized algorithm can effectively avoid local convergence. Compared with the traditional ICP algorithm, when the algorithm achieves the same registration accuracy in the public dataset experiment, the registration speed is on average 44.82% faster and the overlap rate is on average 15.26% higher. In the real dataset experiment, the registration speed is on average 59.04% faster, the registration accuracy is on average 30.24% higher and the overlap rate is on average 10.61% higher. This shows that the optimization algorithm is superior to the traditional ICP algorithm in registration accuracy and convergence speed.

Funder

Natural Science Foundation of Education Department of Anhui Province

Publisher

SAGE Publications

Subject

Applied Mathematics,Control and Optimization,Instrumentation

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A Hybrid Improved SAC-IA with a KD-ICP Algorithm for Local Point Cloud Alignment Optimization;Photonics;2024-07-02

2. Point Cloud Registration Based on Improved Tuna Swarm Optimization Algorithm;2024 39th Youth Academic Annual Conference of Chinese Association of Automation (YAC);2024-06-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3