loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '03) - Volume 1
The Viewing Graph
Madison, Wisconsin
June 18-June 20
ISBN: 0-7695-1900-8
Noam Levi, The Hebrew University of Jerusalem
Michael Werman, The Hebrew University of Jerusalem
The problem we study is; Given N views and a subset of the \[ \left( \begin{gathered} n \hfill \\ 2 \hfill \\ \end{gathered} \right) \] interview fundamental matrices, which of the other fundamental matrices can we compute using oly the pre-computed fundamental matrices. This has applications in 3-D reconstruction and when we want to reproject an area of one view on another, or to compute epipolar lines when the correspondence problem is too difficult to compute between every two views.
A complete solution using linear algorithms to compute the missing fundamental matrices is given for up to six views. In many cases problems with more than six views can also be handled.
Index Terms:
Multi-image Structure, Projective Reconstruction, Structure From Motion, Multiple View Geometry, Linear Reconstruction Techniques
Citation:
Noam Levi, Michael Werman, "The Viewing Graph," cvpr, vol. 1, pp.518, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '03) - Volume 1, 2003
Usage of this product signifies your acceptance of the Terms of Use.