Indoor Point Cloud Registration Process Using ICP Algorithm
DOI:
https://doi.org/10.47611/jsrhs.v10i4.2145Keywords:
Lidar, Point Cloud, SVD, ICP, Point Cloud RegistrationAbstract
In this paper, there are three major sections covered. The paper begins with the explanation of the Lidar sensor, which is a device that uses one or more lasers to measure distances from itself to objects in the world. Such a measurement can be represented as a point cloud, which is a set of (x,y,z) values for every surface that the laser(s) irradiate. Then, the theory of rigid transformations, including the covariance matrix, the translation matrix, and how the Singular Value Decomposition (SVD) can decompose the covariance matrix between two point-clouds to obtain the rotation matrix relating them. In addition, the concept of Iterative Closest Point (ICP) is explored and tested, along with the SVD algorithm, by using the Stanford bunny data sets. Finally, the ICP algorithm is used to combine two different Lidar scans of an office room together to see its effectiveness in a real-world environment.
Downloads
References or Bibliography
S. Spielberg, Director, Ready Player One. [Film]. USA: Warner Bros. Pictures, 2018.
"What is Digital Twin? How does it work?," YouTube, 10 January 2019. [Online]. Available: https://www.youtube.com/watch?v=iVS-AuSjpOQ&ab_channel=GeospatialWorld.
"What is LiDAR? (& Why is It on Apple Devices All of a Sudden)," YouTube, 17 May 2020. [Online]. Available: https://www.youtube.com/watch?v=FOxxqVzDaaA&ab_channel=TheUnlockr.
W. Burgard and C. Stachniss, "Introduction to Mobile Robotics Interative Closest Point Algorithm," [Online]. Available: https://cs.gmu.edu/~kosecka/cs685/cs685-icp.pdf.
D. Kalman, "A Singularly Valuable Decomposition: The SVD of a Matrix," The College Mathematics Journal, vol. 27, no. 1, 1996.
"Velodyne Lidar VLP-16 User Manual," 26 February 2019. [Online]. Available: https://velodynelidar.com/wp-content/uploads/2019/12/63-9243-Rev-E-VLP-16-User-Manual.pdf.
"ROS," ROS.ORG, [Online]. Available: https://www.ros.org/.
P. Evans, "Rotations and rotation matrices," Biological Crystallography, p. 1355~1359, 12 June 2011.
"The Stanford 3D Scanning Repository," Stanford University, 14 August 2014. [Online]. Available: http://graphics.stanford.edu/data/3Dscanrep/.
N. Janakiev, "Understanding the Covariance Matrix," datascience+, 3 August 2018. [Online]. Available: https://datascienceplus.com/understanding-the-covariance-matrix/.
D. Eggert, A. Lorusso and R. Fisher, "Estimating 3-D rigid body transformations: a comparison of four major algorithms," Machine Vision and Applications, pp. 272-290, 1997.
P. Jana and M. Dalibor, "Notes on Iterative Closest Point Algorithm," in 17th Conference on Applied Mathematics, Slovak University of Technology in Bratislava, 2018.
D. Holz, A. Ichim, F. Tombari, R. Rusu and S. Behnke, "Registration with the Point Cloud Library," IEEE Robotics & Automation Magazine, vol. 22, no. 4, pp. 110-124, 2015.
H. Marius, "Tree algorithms explained: Ball Tree Algorithm vs. KD Tree vs. Brute Force," towards data science, 15 June 2020. [Online]. Available: https://towardsdatascience.com/tree-algorithms-explained-ball-tree-algorithm-vs-kd-tree-vs-brute-force-9746debcd940.
"sklearn.neighbors.KDTree," scikit-learn, [Online]. Available: https://scikit-learn.org/stable/modules/generated/sklearn.neighbors.KDTree.html.
J. Shlens, "A Tutorial on Principal Component Analysis," 7 April 2014. [Online]. Available: https://arxiv.org/pdf/1404.1100.pdf.
"numpy.linalg.svd," Numpy.org, [Online]. Available: https://numpy.org/doc/stable/reference/generated/numpy.linalg.svd.html.
"YouTube," dronegenuity, 2 March 2020. [Online]. Available: https://www.youtube.com/watch?v=yXCkyuo8bcs&ab_channel=dronegenuity.
Published
How to Cite
Issue
Section
Copyright (c) 2022 Youngwoo Chang; Nate Bartlett
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Copyright holder(s) granted JSR a perpetual, non-exclusive license to distriute & display this article.
