An algorithm is described which rapidly verifies the potential rigidity of three dimensional point correspondences from a pair of three dimensional views under perspective projection. The output of the algorithm is a simple yes or no answer to the question "Could these corresponding points from two views be the projection of a rigid configuration?" Potential applications include 3D object recognition from a single previous view and correspondence matching for stereo or motion over widely separated views. Rigidity checking verifies point correspondences by using 3D recovery equations as a matching condition. The proposed algorithm improves upon other methods that fall under this approach because it works with as few as six corresponding points under full perspective projection, handles correspondences from widely separated views, makes full use of the disparity of the correspondences, and is integrated with a linear algorithm for 3D recovery due to Kontsevich (1991). Results are given for experiments with synthetic and real image data. A complete implementation of this algorithm is being made publicly available.<>
Rigidity checking of 3D point correspondences under perspective projection
1995-01-01
729517 byte
Conference paper
Electronic Resource
English
Rigidity Checking of 3D Point Correspondences under Perspective Projection
British Library Conference Proceedings | 1995
|3D Structure Reconstruction from Point Correspondences between Two Perspective Projections
British Library Online Contents | 1994
|British Library Conference Proceedings | 2002
|Complete Scene Structure from Four Point Correspondences
British Library Conference Proceedings | 1995
|