Answers are grounded in this paper and cite their sources.
Comparative analysis demonstrates least-squares fitting via singular value decomposition in paired 3-D point sets, highlighting reduced computer time requirements.
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.
No takes yet. Share an insight, caveat, or question.
Arun et al. (1987) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: