Viewing Graph Solvability via Cycle Consistency

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Viewing Graph Solvability via Cycle Consistency

Popis výsledku v původním jazyce

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

Název v anglickém jazyce

Viewing Graph Solvability via Cycle Consistency

Popis výsledku anglicky

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

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

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

Projekt

<a href="/cs/project/EF15_003%2F0000468" target="_blank" >EF15_003/0000468: Inteligentní strojové vnímání</a><br>

Návaznosti

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

Rok uplatnění

2021

Kód důvěrnosti údajů

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

Název statě ve sborníku

ICCV2021: Proceedings of the International Conference on Computer Vision

ISBN

978-1-6654-2812-5

ISSN

1550-5499

e-ISSN

2380-7504

Počet stran výsledku

10

Strana od-do

5520-5529

Název nakladatele

IEEE

Místo vydání

Piscataway

Místo konání akce

Montreal

Datum konání akce

11. 10. 2021

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000797698905074