用代数几何分析相机图可解性，验证了此前未解猜想。
An Algebraic Geometry Approach to Viewing Graph Solvability
- 基于代数几何构建相机图可解性分析新框架
- 证明了一个关于结构光恢复图可解性的长期猜想
- 适合计算机视觉与几何建模方向研究者阅读
视图图是结构光恢复中的重要数学结构，其中节点代表相机，边表示重叠视图间的对极几何关系。可解性研究关注在何种条件下，相机位姿能被唯一确定。本文提出一种基于代数几何的新分析框架，有效揭示结构光恢复图的可解性机制，并成功证明了一个此前提出的未解猜想。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。