Shape and motion without depth

Inferring the depth and shape of remote objects and the camera motion from a sequence of images is possible in principle, but is an ill-conditioned problem when the objects are distant with respect to their size. This problem is overcome by inferring shape and motion without computing depth as an intermediate step. On a single epipolar plane, an image sequence can be represented by the F*P matrix of the image coordinates of P points tracked through F frames. It is shown that under orthographic projection this matrix is of rank three. Using this result, the authors develop a shape-and-motion algorithm based on singular value decomposition. The algorithm gives accurate results, without relying on any smoothness assumption for either shape or motion.<<ETX>>

[1]  J. Aloimonos,et al.  Optimal motion estimation , 1989, [1989] Proceedings. Workshop on Visual Motion.

[2]  Thomas S. Huang,et al.  Uniqueness and Estimation of Three-Dimensional Motion Parameters of Rigid Objects with Curved Surfaces , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Michael A. Malcolm,et al.  Computer methods for mathematical computations , 1977 .

[4]  H. C. Longuet-Higgins,et al.  A computer algorithm for reconstructing a scene from two projections , 1981, Nature.

[5]  Joachim Heel,et al.  Dynamic Motion Vision , 1989, Other Conferences.

[6]  S. Ullman,et al.  The interpretation of visual motion , 1977 .