• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

shape and motion from image streams: a factorization method (1991)

Cached

  • Download as a PDF

Download Links

  • [www.ces.clemson.edu]
  • [www.cs.duke.edu]
  • [reports-archive.adm.cs.cmu.edu]
  • [reports-archive.adm.cs.cmu.edu]
  • [reports.adm.cs.cmu.edu]
  • [reports.adm.cs.cmu.edu]
  • [www.ri.cmu.edu]
  • [www.ri.cmu.edu]
  • [www.ri.cmu.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Carlo Tomasi , Takeo Kanade
Venue:International Journal of Computer Vision
Citations:174 - 12 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Tomasi91shapeand,
    author = {Carlo Tomasi and Takeo Kanade},
    title = {shape and motion from image streams: a factorization method},
    institution = {International Journal of Computer Vision},
    year = {1991}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

The factorization method described in this series of reports requires an algorithm to track the motion of features in an image stream. Given the small inter-frame displacement made possible by the factorization approach, the best tracking method turns out to be the one proposed by Lucas and Kanade in 1981. The method defines the measure of match between fixed-size feature windows in the past and current frame as the sum of squared intensity differences over the windows. The displacement is then defined as the one that minimizes this sum. For small motions, a linearization of the image intensities leads to a Newton-Raphson style minimization. In this report, after rederiving the method in a physically intuitive way, we answer the crucial question of how to choose the feature windows that are best suited for tracking. Our selection criterion is based directly on the definition of the tracking algorithm, and expresses how well a feature can be tracked. As a result, the criterion is optimal by construction. We show by experiment that the performance of both the selection and the tracking algorithm are adequate for our factorization method, and we address the issue of how to detect occlusions. In the conclusion, we point out specific open questions for future research. Chapter 1

Citations

1480 An iterative image registration technique with an application to stereo vision - Lucas, Kanade - 1981
270 Uniqueness and estimation of three dimensional motion parameters of rigid objects with curved surfaces - Tsai, Huang - 1984
214 Determining three-dimensional motion and structure from optical flow generated by several moving objects - Adiv - 1985
123 Direct methods for recovering motion - Horn, Weldon - 1988
100 Singular value decomposition and least squares solutions - Golub, Reinsch - 1970
23 A rational algebraic formulation of the problem of relative orientation - Thompson - 1959
22 Shape and motion without depth - Tomasi, Kanade - 1990
19 Visual perception of three-dimensional motion - Heeger, Jepson - 1990
6 Egomotion and Relative Depth from Optical Flow - Prazdny - 1980
3 Egomotion and relative depth from optical ow - Prazdny - 1980
1 Tsai et al - Tsai, Huang, et al. - 1984
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University