Viewing Graph Solvability via Cycle Consistency

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F21%3A00356041" target="_blank" >RIV/68407700:21730/21:00356041 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1109/ICCV48922.2021.00549" target="_blank" >https://doi.org/10.1109/ICCV48922.2021.00549</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/ICCV48922.2021.00549" target="_blank" >10.1109/ICCV48922.2021.00549</a>

Result language

angličtina

Original language name

Viewing Graph Solvability via Cycle Consistency

Original language description

In structure-from-motion the viewing graph is a graph where vertices correspond to cameras and edges represent fundamental matrices. We provide a new formulation and an algorithm for establishing whether a viewing graph is solvable, i.e. it uniquely determines a set of projective cam eras. Known theoretical conditions either do not fully char acterize the solvability of all viewing graphs, or are ex ceedingly hard to compute for they involve solving a system of polynomial equations with a large number of unknowns. The main result of this paper is a method for reducing the number of unknowns by exploiting the cycle consistency. We advance the understanding of the solvability by (i) finish ing the classification of all previously undecided minimal graphs up to 9 nodes, (ii) extending the practical solvability testing up to minimal graphs with up to 90 nodes, and (iii) definitely answering an open research question by showing that the finite solvability is not equivalent to the solvability. Finally, we present an experiment on real data showing that unsolvable graphs are appearing in practical situations

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/EF15_003%2F0000468" target="_blank" >EF15_003/0000468: Intelligent Machine Perception</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2021

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

ICCV2021: Proceedings of the International Conference on Computer Vision

ISBN

978-1-6654-2812-5

ISSN

1550-5499

e-ISSN

2380-7504

Number of pages

10

Pages from-to

5520-5529

Publisher name

IEEE

Place of publication

Piscataway

Event location

Montreal

Event date

Oct 11, 2021

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000797698905074