Skip to Main content Skip to Navigation
Conference papers

On the Solvability of Viewing Graphs

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.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01856159
Contributor : Matthew Trager <>
Submitted on : Thursday, August 9, 2018 - 7:09:40 PM
Last modification on : Wednesday, August 7, 2019 - 12:19:20 PM
Document(s) archivé(s) le : Saturday, November 10, 2018 - 1:31:31 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01856159, version 1

Collections

Citation

Matthew Trager, Brian Osserman, Jean Ponce. On the Solvability of Viewing Graphs. European Conference on Computer Vision 2018 (ECCV 2018), Sep 2018, Munich, Germany. ⟨hal-01856159⟩

Share

Metrics

Record views

205

Files downloads

110