Least-squares fitting of two 3-d point sets.

Area of Science:

• Computer Vision
• Robotics
• Computational Geometry

Background:

• Accurate 3D point set registration is crucial for various applications.
• Existing methods for estimating rotation (R) and translation (T) between point sets can be computationally intensive.

Purpose of the Study:

• To develop and evaluate a novel algorithm for determining the least-squares solution of rotation (R) and translation (T) between two 3D point sets.
• To compare the computational efficiency of the new algorithm against existing methods.

Main Methods:

• The proposed algorithm leverages the singular value decomposition (SVD) of a 3x3 matrix to find the optimal R and T.
• The algorithm takes two sets of corresponding points, {pi} and {p'i}, as input, where p'i = Rpi + T + Ni (Ni represents noise).

Main Results:

• The SVD-based algorithm provides a direct and efficient method for solving the least-squares problem.
• Comparative analysis indicates favorable computer time requirements for the new algorithm relative to two previously established algorithms.

Conclusions:

• The singular value decomposition (SVD) offers an effective approach for robustly estimating rotation and translation in 3D point set registration.
• The presented algorithm demonstrates a practical improvement in computational speed for this fundamental geometric problem.