On the Solvability of Viewing Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

On the Solvability of Viewing Graphs


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.
Fichier principal
Vignette du fichier
main.pdf (369.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01856159 , version 1 (09-08-2018)


  • HAL Id : hal-01856159 , version 1


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⟩
110 View
165 Download


Gmail Facebook X LinkedIn More