Skip to main content

Shape and motion without depth

Publication ,  Journal Article
Tomasi, C; Kanade, T
December 1, 1990

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.

Duke Scholars

Publication Date

December 1, 1990

Start / End Page

91 / 95
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Tomasi, C., & Kanade, T. (1990). Shape and motion without depth, 91–95.
Tomasi, C., and T. Kanade. “Shape and motion without depth,” December 1, 1990, 91–95.
Tomasi C, Kanade T. Shape and motion without depth. 1990 Dec 1;91–5.
Tomasi, C., and T. Kanade. Shape and motion without depth. Dec. 1990, pp. 91–95.
Tomasi C, Kanade T. Shape and motion without depth. 1990 Dec 1;91–95.

Publication Date

December 1, 1990

Start / End Page

91 / 95