Rapid Method for Point Clouds Registration Based on Reference Points

Abstract:

Incremental point clouds registration is studied in this paper. A rapid method for point clouds registration based on reference points is proposed, which consists of the coarse registration and fine registration. Firstly, a set of reference points is applied as an assistant utility to measure the object. The transformation parameters are estimated by using the reference points only for coarse registration, and then dense point clouds data will be transformed to the same coordinate system. Secondly, taking the coarse registration results as the initial value, the improved Interactive Closest Point (ICP) algorithm is used in fine registration the original corresponding points are established rapidly by using the k-d tree searching algorithm. Finally, Preview Model Parameters Evaluation Random Sample Consensus (PERANSAC) algorithm is utilized to remove outliers. The experimental result shows that this method in finding original corresponding points can greatly improve the computation efficiency and also improve the registration accuracy.

• Periodical: Applied Mechanics and Materials (Volumes 48-49)
• Pages: 873-876
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.48-49.873
• Online since: February 2011
• Authors: Hou Jun Yang, Wei Zhong Zhang, Xiao Lie Liu
• Keywords: K-D Tree, PERANSAC Algorithm, Point Cloud Registration, Reference Point

References

[1] Zhang Shun-de, Lu Bing-heng, Ding Yu-cheng, in: Study on data registration of subdivided shaped in optical 3-D profilometry, Chinese Journal of Lasers, 2001, 28 (6): 533-536.

[2] Besl P J, M ekay N D, in: A Method for Registration of 3D Shapes, IEEE Transactions on Pattern Analysis and Machine Intelligence, 1992, 14(2): 239-255.

[3] Chen Y, Medioni G, in: Object modeling by registration of multiple range images, Image and Vision Computing, 1992, 10(3): 145-155.

DOI: 10.1016/0262-8856(92)90066-c

[4] Kwang-Ho Bae, Derek D. Lichti, in: A method for Automated registration of Unorganized point clouds, Journal of Photogrammetry and Remote Sensing, 2008, 63(1): 36-54.

DOI: 10.1016/j.isprsjprs.2007.05.012

[5] Kwang-Ho Bae, David Belton, Derek D. Lichti, in: A Closed- Form Expression of the Positional Uncertainty for 3D Point Clouds, IEEE Transactions on Pattern Analysis and Machine Intelligence, 2009, 31(4): 577-590.

DOI: 10.1109/tpami.2008.116

[6] Wei Hu, Liu Sheng-lan, Zhang Li-yan, in: Reference Point Based Registration Algorithm for Binocular Stereo Vision System[J], Chinese Journal of Mechanical Engineering.

[7] XU Xiao-dong, ZHAO Yi, LI Cong-xin, in: The Technique about Registration of Multi-view Data in the Optical Digitizing Measuring and Algorithm Realization, Machine Tool and Hydraulics, 2005，10: 137-140.

[8] Horn B K P, in: Closed form solution of absolute orientation using unit quaternions, Journal of the Optical Society of America A, 1987, 4(4): 629-642.

DOI: 10.1364/josaa.4.000629

[9] Arun K S, Huang T S, Blostein S D, in: Least-squares fitting of two 3-D point sets, IEEE Transactions on Pattern Analysis and Machine Intelligence, 1987, 9(5): 698-700.

DOI: 10.1109/tpami.1987.4767965

[10] Horn B K P, Hilden H M, Negahdaripour S, in: Closed form solution of absolute orientation using orthonormal matrices", Journal of the Optical Society of America 1988, 5(7): 1127-1135.

DOI: 10.1364/josaa.5.001127

[11] Walker M W, Shao L, Volz R A, in: Estimating 3-D location parameters using dual number quaternions, Computer Vision and Graph Image Processing: Image Understand, 1991, 54(3): 358-367.

DOI: 10.1016/1049-9660(91)90036-o

[12] DAI Jing-lan, CHEN Zhi-yang , YE Xiu-zi, in: The Application of ICP Algorithm in Point Cloud Alignment. Journal of Image and Graphics", 2007, 12(3): 517-521.

[13] Liu Yu, Xiong You-lun, in: Algorithm for searching nearest- neighbor based on the bounded k-d tree, Journal of Huazhong University of Science and Technology, 2008, 36(7): 73-76.

[14] CHEN Fu-Xing, WANG Run-Sheng, in: Fast RANSAC with Preview Model Parameters Evaluation[J], Journal of Soft ware, 2005, 16(8): 1431-1437.