loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1996 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'96)
A Factorization Method for Affine Structure from Line Correspondences
San Francisco, Ca.
June 18-June 20
ISBN: 0-8186-7258-7
Long Quan, The Robotics Institute Carnegie Mellon University Pittsburgh, PA 15213
Takeo Kanade, The Robotics Institute Carnegie Mellon University Pittsburgh, PA 15213
A family of structure from motion algorithms called the factorization method has been recently developed from the orthographic projection model to the affine camera model. All these algorithms are limited to handling only point features of the image stream. We propose in this paper an algorithm for the recovery of shape and motion from line correspondences by the factorization method with the affine camera. Instead of one step factorization for points, a multi-step factorization method is developed for lines based on the decomposition of the whole shape and motion into three separate substructures. Each of these substructures can then be linearly solved by factorizing the appropriate measurement matrices. It is also established that affine shape and motion with uncalibrated affine cameras can be achieved with at least seven lines over three views, which extends the previous results of Koenderink and Van Doorn for points to lines.
Index Terms:
structure from motion, factorization method, line correspondence, affine camera, one-dimensional camera
Citation:
Long Quan, Takeo Kanade, "A Factorization Method for Affine Structure from Line Correspondences," cvpr, pp.803, 1996 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'96), 1996
Usage of this product signifies your acceptance of the Terms of Use.