BriefGPT.xyz
Aug, 2018
关于可视化图的可解性
On the Solvability of Viewing Graphs
HTML
PDF
Matthew Trager, Brian Osserman, Jean Ponce
TL;DR
通过研究和表征可解的视图图谱，提出多种新的结果并讨论了可解性的计算验证方法，以判断基本矩阵是否足够回收全局的摄像机配置。
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
→