-
On the Solvability of Viewing Graphs
AbstractA set of fundamental matrices relating pairs of cameras in some configuration can be represented as edges of a ``viewing graph''. Whether or not these fundamental matrices are generically sufficient to recover the global camera configuration depends on the structure of this graph. We study characterizations of ``solvable'' viewing graphs, and present several new results that can be applied to determine which pairs of views may be used to recover all camera parameters. We also discuss strategies for verifying the solvability of a graph computationally.
Related Material
[pdf] [arXiv][bibtex]@InProceedings{Trager_2018_ECCV,
author = {Trager, Matthew and Osserman, Brian and Ponce, Jean},
title = {On the Solvability of Viewing Graphs},
booktitle = {Proceedings of the European Conference on Computer Vision (ECCV)},
month = {September},
year = {2018}
}
ECCV 2018 papers
The ECCV 2018 papers, provided here by the Computer Vision Foundation, are the author-created versions. The content of the papers is identical to the content of the officially published ECCV 2018 LNCS version of the papers as available on SpringerLink: https://link.springer.com/conference/eccv.
Intellectual property rights, copyright and all rights therein are retained by authors, by Springer as the publisher of the official ECCV 2018 proceedings or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.