Abstract
We propose a simple, fast three-dimensional (3D) matching method that determines the best rotation matrix between non-corresponding point clouds (PCs) with no iterations. An estimated rotation matrix can be derived by the two following steps: (1) the singular value decomposition is applied to a measured data matrix, and a database matrix is constructed from the PC datasets; (2) the inner product of each left singular vector is used to produce the estimated rotation. Through experimentation, we demonstrate that the proposed method executes 3D PC matching with <4 % of the computational time of the iterative closest point algorithm with nearly identical accuracy.




Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Yongjin J, Kurazume R, Iwashita Y, Hasegawa T (2013) Global localization for mobile robot using large-scale 3D environmental map and RGB-D camera. J Robot Soc Jpn 31(9):896–906
Besl PJ, Mckay ND (1992) A method for registration of 3-D shapes. IEEE Trans Pattern Anal Mach Intell 14(2):239–256
Takeshi M (2009) ICP algorithm. CVIM 186(23):1–8
Nishida T, Kurogi S (2013) Rotation matrix estimation between non-corresponding 3-D point sets. J Robot Soc Jpn 31(6):624–627
Oomori S, Nishida T, Kurogi S (2015) Point cloud matching using singular value decomposition. In: Proceedings of international symposium on artificial life and robotics, pp 451–454
Tamaki T (2009) Pose estimation and rotation matrices. SIS 109(203):59–64
Akca MD (2003) Generalized procrustes analysis and its applications in photogrammetry. Technical report, ETH, Swiss Federal Institute of Technology Zurich, Institute of Geodesy and Photogrammetry
Kanatani K (1994) Analysis of 3-D rotation fitting. IEEE Trans Pattern Anal Mach Intell 16(5):1–25
Ueyama S (1991) Least-squares estimation of transformation parameter between two point patterns. IEEE Trans Pattern Anal Mach Intell 13(4):376–380
Arun KS, Huang TS, Blostein SD (1987) Least-squares fitting of two 3-D point sets. IEEE Trans Pattern Anal Mach Intell 9(5):698–700
Schӧneman PH (1966) A generalized solution of the orthogonal procrusters problem. Psychometrika 31(1):1–10
Papadimitriou P (1993) Parallel solution of SVD-related problems, with applications. PhD thesis, University of Manchester
GNU Science Library. http://www.gnu.org/software/gsl/
Gonzalez-Jorge H, Riveiro B, Vazquez-Fernandez E, Martinez-Sanchez J, Arias P (2013) Metrological evaluation of microsoft kinect and asus xtion sensors. Measurement 46:1800–1806
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Oomori, S., Nishida, T. & Kurogi, S. Point cloud matching using singular value decomposition. Artif Life Robotics 21, 149–154 (2016). https://doi.org/10.1007/s10015-016-0265-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10015-016-0265-x