Evaluation of a novel multiple point set registration algorithm

We briefly describe a novel solution to the simultaneous multiple view point registration problem and evaluate its performance in a practical machine vision application. The algorithm involves computation of a constant matrix which encodes the point set registration, from which the optimal rigid transformations are found using a simple and efficient iterative algorithm. We describe this algorithm's incorporation into a multiple view surface registration system, and present results from experiments on two different sets of real surface data. These results demonstrate that the proposed algorithm is accurate and efficient.

[1]  K. S. Arun,et al.  Least-Squares Fitting of Two 3-D Point Sets , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Marc Rioux,et al.  Three-dimensional registration using range and intensity information , 1994, Other Conferences.

[3]  Xinhua Zhuang,et al.  Pose estimation from corresponding point data , 1989, IEEE Trans. Syst. Man Cybern..

[4]  Marc Levoy,et al.  Zippered polygon meshes from range images , 1994, SIGGRAPH.

[5]  Adrian Hilton,et al.  Registration of multiple point sets , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[6]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  John A. Williams,et al.  Simultaneous registration of multiple point sets using orthonormal matrices , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).