ML Anthology

The Viewing Graph

Noam Levi, Michael Werman
CVPR 2003 pp. 518-524
doi:10.1109/CVPR.2003.1211398 /cvpr/2003/levi2003cvpr-viewing/

Abstract

The problem we study is: given N views and a subset of the (/sub 2//sup 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.

CVPR Semantic Scholar

Cite

Text

Levi and Werman. "The Viewing Graph." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2003. doi:10.1109/CVPR.2003.1211398

Markdown

[Levi and Werman. "The Viewing Graph." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2003.](https://mlanthology.org/cvpr/2003/levi2003cvpr-viewing/) doi:10.1109/CVPR.2003.1211398

BibTeX

@inproceedings{levi2003cvpr-viewing,
  title     = {{The Viewing Graph}},
  author    = {Levi, Noam and Werman, Michael},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2003},
  pages     = {518-524},
  doi       = {10.1109/CVPR.2003.1211398},
  url       = {https://mlanthology.org/cvpr/2003/levi2003cvpr-viewing/}
}