The Community for Technology Leaders
Green Image
Issue No. 05 - May (1987 vol. 9)
ISSN: 0162-8828
pp: 698-700
T. S. Huang , Coordinated Science Laboratory, University of Illinois, Urbana, IL 61801.
S. D. Blostein , Coordinated Science Laboratory, University of Illinois, Urbana, IL 61801.
K. S. Arun , Coordinated Science Laboratory, University of Illinois, Urbana, IL 61801.
ABSTRACT
Two point sets {pi} and {p'i}; i = 1, 2,..., N are related by p'i = Rpi + T + Ni, where R is a rotation matrix, T a translation vector, and Ni a noise vector. Given {pi} and {p'i}, we present an algorithm for finding the least-squares solution of R and T, which is based on the singular value decomposition (SVD) of a 3 Ã- 3 matrix. This new algorithm is compared to two earlier algorithms with respect to computer time requirements.
INDEX TERMS
CITATION
T. S. Huang, S. D. Blostein, K. S. Arun, "Least-Squares Fitting of Two 3-D Point Sets", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 9, no. , pp. 698-700, May 1987, doi:10.1109/TPAMI.1987.4767965
88 ms
(Ver 3.3 (11022016))