Abstract

In order to improve the efficiency of matching marked points, the accuracy and automation of point cloud stitching, a stitching algorithm of dynamic hierarchy of the iterative closest point is proposed. First, the dynamic distance matrix was introduced to record the distance of hierarchical searching marked point; to complete the coarse stitching, the marked point was matched through the dynamic distance matrix and the least square method was used to resolve the transformation matrix. Second, at the stage of precisely stitching dynamic hierarchical search points a set was taken to initialize a valid initial position for the iterative closest point algorithm, then the local optimum of the iterative closest point algorithm was avoided. In a three-dimensional stitching experiment the precise stitching distance error has reached 0.0085 mm; the method is testified to be simple, practical and characterized by high stitching precision.

© 2015 Optical Society of America

Experimental study on subaperture testing with iterative stitching algorithm

Shanyong Chen, Shengyi Li, Yifan Dai, Lingyan Ding, and Shengyue Zeng
Opt. Express 16(7) 4760-4765 (2008)

Three-dimensional stitching of stereo-deflectometry based on marker points

Xiaoxiao Wei, Hao Zhang, Tianmei Zou, and ZhenLei Wang
Appl. Opt. 61(25) 7323-7329 (2022)

PDC-Net: Robust point cloud registration using deep cyclic neural network combined with PCA

Dengzhi Liu, Yu Zhang, Lin Luo, Jinlong Li, and Xiaorong Gao
Appl. Opt. 60(11) 2990-2997 (2021)

Iterative algorithm for subaperture stitching interferometry for general surfaces

Shanyong Chen, Shengyi Li, and Yifan Dai
J. Opt. Soc. Am. A 22(9) 1929-1936 (2005)

Iterative algorithm for subaperture stitching test with spherical interferometers

Shanyong Chen, Shengyi Li, Yifan Dai, and Ziwen Zheng
J. Opt. Soc. Am. A 23(5) 1219-1226 (2006)