The viewing graph

Author

Levi, Noam ; Werman, Michael

Author_Institution

Sch. of Comput. Sci., The Hebrew Univ. of Jerusalem, Israel

Volume

1

fYear

2003

Abstract

The problem we study is: given N views and a subset of the (₂^N) interview fundamental matrices, which of the other fundamental matrices can we compute using only the pre-computed fundamental matrices. This has applications in 3D (three-dimensional) 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 are given for up to six views. In many cases problems with more than six views can also be handled.

Keywords

computational geometry; graph theory; image reconstruction; matrix algebra; 3D reconstruction; epipolar line computation; fundamental matrix; linear algorithm; linear reconstruction; motion structure; multi-image structure; multiple view geometry; projective reconstruction; viewing graph; Cameras; Computational geometry; Computer Society; Computer science; Computer vision; Equations; Layout; Pattern recognition; Tensile stress; Three dimensional displays;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE Computer Society Conference on

ISSN

1063-6919

Print_ISBN

0-7695-1900-8

Type

conf

DOI

10.1109/CVPR.2003.1211398

Filename

1211398