a registration algorithm based on bounded rotation angle is proposed to solve the problem of the existing 3D point cloud algorithm which cant complete registration with large rotation angle change. Firstly
the global registration is transformed into regional registration according to the low dimensional nature of the rigid body transformation
and it achieves initial registration through the four steps of region division
region registration
solving combination coefficient and solving rigid body transformation; Secondly
the basic ICP algorithm is improved by setting boundary for rotation angle to achieve fine registration. The experimental results show that the proposed algorithm in the paper is accurate
fast and robust
and it can avoid the interference of noises and outliers.
关键词
Keywords
references
Herrmann M, Otesteanu M, Otto M. Fast and robust point cloud matching based on EM-ICP prepositioning[C]//2012 10th International Symposium on Electronics and Telecommunications (ISETC). UK, Timisoara, 2012: 99-103.
Besl P J, McKay N D. A method for registration of 3-D shapes[J]. IEEE Trans. Pattern Anal. Mach. Intell, 1992, 14(2): 239-256. DOI: 239
Nuchter A, Lingemann K, Hertzberg J. Cached kd tree search for ICP algorithms[C]//Sixth International Conference on 3-D Digital Imaging and Modeling. Quebec, Canada, 2007: 419-426.
Zhang Chunjia, Du Shaoyi, Liu Juan. Robust 3D point set registration using iterative closest point algorithm with bounded rotation angle[J]. Signal Processing, 2016, 120(C): 777-788. DOI: 777