The viewing graph

Noam Levi*, Michael Werman

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

34 Scopus citations

Abstract

The problem we study is; Given N views and a subset of the (N/2) interview fundamental matrices, which of the other fundamental matrices can we compute using only 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.

Original languageEnglish
Pages (from-to)I/518-I/522
JournalProceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Volume1
StatePublished - 2003
Event2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Madison, WI, United States
Duration: 18 Jun 200320 Jun 2003

Keywords

  • Linear reconstruction techniques
  • Multi-image structure
  • Multiple view geometry
  • Projective reconstruction
  • Structure from motion

Fingerprint

Dive into the research topics of 'The viewing graph'. Together they form a unique fingerprint.

Cite this