The Robotics Institute

Carnegie Mellon Robotics Institute

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

This paper addresses the general 3-D rigid motion problem, where the point correspondences and the motion parameters between two sets of 3-D points are to be recovered. The existence of missing points in the two sets is the most difficult problem. We first show a mathematical symmetry in the solutions of rotation parameters and point correspondences. A closed-form solution based on the correlation matrix eigenstructure decomposition is proposed for correspondence recovery with no missing points. Using a heuristic measure of point pair affinity derived from the eigenstructure, a weighted bipartite matching algorithm is developed to determine the correspondences in general cases where missing points occur. The use of the affinity heuristic also leads to a fast outlier removal algorithm, which can be run iteratively to refine the correspondence recovery. Simulation results and experiments on real images are shown in both ideal and general cases.

Notes

Text Reference

X. Wang, Y. Cheng, Robert Collins, and A. Hanson, "Determining Correspondences and Rigid Motion of 3-D Point Sets with Missing Data," IEEE Computer Vision and Pattern Recognition, June, 1996, pp. 252-257.

BibTeX Reference

@inproceedings{Collins_1996_1914,
   author = "X. Wang and Y. Cheng and Robert Collins and A. Hanson",
   title = "Determining Correspondences and Rigid Motion of 3-D Point Sets with Missing Data",
   booktitle = "IEEE Computer Vision and Pattern Recognition",
   pages = "252-257",
   month = "June",
   year = "1996",
}

The Robotics Institute

Menu