Abstract
A 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.
Author supplied keywords
Cite
CITATION STYLE
Trager, M., Osserman, B., & Ponce, J. (2018). On the Solvability of Viewing Graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11220 LNCS, pp. 335–350). Springer Verlag. https://doi.org/10.1007/978-3-030-01270-0_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
