Registration Method of Partial Point Cloud and Whole Point Cloud of Large Workpiece

被引:0
|
作者
Fan L. [1 ,2 ,3 ]
Wang J. [1 ,2 ]
Xu Z. [1 ,2 ]
Yang X. [1 ,2 ]
Zhu X. [1 ,2 ,3 ]
Dong Q. [1 ,2 ,4 ]
Wu X. [5 ]
机构
[1] State Key Laboratory of Robotics, Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang
[2] Institutes for Robotics and Intelligent Manufacturing, Chinese Academy of Sciences, Shenyang
[3] Shenyang Institute of Automation, University of Chinese Academy of Sciences, Beijing
[4] School of Mechanical and Electrical Engineering, Shenyang Aerospace University, Shenyang
[5] Xi’an North Huian Chemical Industries Co.,Ltd, Xi’an
关键词
dimensional evaluation; local feature description; partial point cloud; point cloud registration;
D O I
10.3724/SP.J.1089.2023.19688
中图分类号
学科分类号
摘要
The high-efficiency and high-precision registration of the partial point cloud and the whole point cloud is the basis for the rapid evaluation of the size of large workpieces. However, due to the difference between the global features of the partial point cloud and the whole point cloud, using the existing local feature descriptors for point pair matching search requires a lot of computation, and point cloud registration takes a long time. To solve this problem, in view of the geometric features of partial point cloud and whole point cloud, a registration method of partial point cloud and whole point cloud based on regional mean feature descriptor is proposed. Firstly, a regional mean feature descriptor is proposed, which can effectively describe the neighborhood geometric features of key points in the point cloud. Secondly, the data points are selected as the key points to be registered by evaluating the feature degree of the regional mean feature descriptors, search the matching descriptor to complete the key point matching between the partial point cloud and the whole point cloud. Finally, use the singular value decomposition method to calculate the transformation matrix between the point clouds, and register the partial point cloud and the whole point cloud based on the iterative closest point algorithm. The registration accuracy and registration speed are tested by using the point cloud set of the Stanford public database and the 3D scanning point cloud data of a large engine compartment. Compared with the point cloud registration methods of PFH, HoPPF, PPFH, and FPFH, the registration accuracy of the proposed method is increased by 56.75% on average, and the registration speed is increased by 45.57% on average. The effectiveness of the method is verified. © 2023 Institute of Computing Technology. All rights reserved.
引用
收藏
页码:1323 / 1332
页数:9
相关论文
共 25 条
  • [1] Wu C, Yuan Y B, Tang Y, Et al., Application of terrestrial laser scanning (TLS) in the architecture, engineering and construction (AEC) industry, Sensors, 22, 1, (2022)
  • [2] Cheng Xu, Research on 3D reconstruction and point cloud registration technology of complex parts, (2019)
  • [3] Reyno T, Marsden C, Wowk D., Surface damage evaluation of honeycomb sandwich aircraft panels using 3D scanning technology, NDT and E International, 97, pp. 11-19, (2018)
  • [4] Yao Dong, Research on key technologies of large field of view white light interferometry for 3D topography measurement, (2021)
  • [5] Besl P J, McKay N D., A method for registration of 3-D shapes, IEEE Transactions on Pattern Analysis and Machine Intelligence, 14, 2, pp. 239-256, (1992)
  • [6] Cheng X, Li Z W, Zhong K, Et al., An automatic and robust point cloud registration framework based on view-invariant local feature descriptors and transformation consistency verification, Optics and Lasers in Engineering, 98, pp. 37-45, (2017)
  • [7] Jiang Yue, Huang Hongguang, Shu Qin, Et al., Scale point cloud registration algorithm in high-dimensional orthogonal subspace mapping, Acta Optica Sinica, 39, 3, pp. 290-300, (2019)
  • [8] Li Raobo, Yuan Xiping, Gan Shu, Et al., Research on point cloud registration method using gravity feature transformation, Acta Photonica Sinica, 50, 11, pp. 145-155, (2021)
  • [9] Makovetskii A, Voronin S, Kober V, Et al., An algorithm for rough alignment of point clouds in three-dimensional space, Proceedings of ITNT the 6th IEEE International Conference on Information Technology and Nanotechnology, pp. 1-4, (2020)
  • [10] Anderson J D, Raettig R M, Larson J, Et al., Delaunay walk for fast nearest neighbor: accelerating correspondence matching for ICP, Machine Vision and Applications, 33, 2, (2022)