TL;DR
This paper investigates the conditions under which viewing graphs, representing camera relationships via fundamental matrices, can be used to recover camera configurations, providing new characterizations and computational strategies for solvability.
Contribution
It introduces new characterizations of solvable viewing graphs and discusses methods to verify their solvability computationally.
Findings
New criteria for viewing graph solvability
Strategies for computational verification of graph solvability
Insights into which camera pairs enable full configuration recovery
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
