An Algebraic Geometry Approach to Viewing Graph Solvability
This addresses a theoretical challenge in computer vision for researchers, but appears incremental as it builds on existing solvability studies.
The paper tackles the problem of determining when cameras are uniquely defined by viewing graphs in structure-from-motion, using an algebraic geometry framework to prove a previously proposed conjecture.
The concept of viewing graph solvability has gained significant interest in the context of structure-from-motion. A viewing graph is a mathematical structure where nodes are associated to cameras and edges represent the epipolar geometry connecting overlapping views. Solvability studies under which conditions the cameras are uniquely determined by the graph. In this paper we propose a novel framework for analyzing solvability problems based on Algebraic Geometry, demonstrating its potential in understanding structure-from-motion graphs and proving a conjecture that was previously proposed.