Revisiting Viewing Graph Solvability : an Effective Approach Based on Cycle Consistency

In the structure from motion, the viewing graph is a graph where the vertices correspond to cameras (or images) and the edges represent the fundamental matrices. We provide a new formulation and an algorithm for determining whether a viewing graph is solvable, i.e., uniquely determines a set of proj...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on pattern analysis and machine intelligence. - 1979. - PP(2022) vom: 10. Okt.
1. Verfasser:	Arrigoni, Federica (VerfasserIn)
Weitere Verfasser:	Fusiello, Andrea, Rizzi, Romeo, Ricci, Elisa, Pajdla, Tomas
Format:	Online-Aufsatz
Sprache:	English
Veröffentlicht:	2022
Zugriff auf das übergeordnete Werk:	IEEE transactions on pattern analysis and machine intelligence
Schlagworte:	Journal Article