The viewing graph

  • Authors:
  • Noam Levi;Michael Werman

  • Affiliations:
  • School of Computer Science, The Hebrew University of Jerusalem, Jerusalem, Israel;School of Computer Science, The Hebrew University of Jerusalem, Jerusalem, Israel

  • Venue:
  • CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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 precomputed 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.