A Direct Approach to Viewing Graph Solvability

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F25%3A00388108" target="_blank" >RIV/68407700:21730/25:00388108 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1007/978-3-031-73232-4_18" target="_blank" >https://doi.org/10.1007/978-3-031-73232-4_18</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-031-73232-4_18" target="_blank" >10.1007/978-3-031-73232-4_18</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A Direct Approach to Viewing Graph Solvability

Popis výsledku v původním jazyce

The viewing graph is a useful way to represent uncalibrated cameras and their geometric relationships: nodes correspond to cameras and edges represent fundamental matrices. By analyzing this graph, it is possible to establish if the problem is “solvable” in the sense that there exists a unique (up to a single projective transformation) set of cameras that are compliant with the given fundamental matrices. In this paper, we take several steps forward in the study of viewing graph solvability: we propose a new formulation of the problem that is more direct than previous literature, based on a formula that explicitly links pairs of cameras via their fundamental matrix; we introduce the new concept of “infinitesimal solvability”, demonstrating its usefulness in understanding real structure from motion graphs; we propose an algorithm for testing infinitesimal solvability and extracting components of unsolvable cases, that is more efficient than previous work; we set up an open question on the connection between infinitesimal solvability and solvability.

Název v anglickém jazyce

A Direct Approach to Viewing Graph Solvability

Popis výsledku anglicky

The viewing graph is a useful way to represent uncalibrated cameras and their geometric relationships: nodes correspond to cameras and edges represent fundamental matrices. By analyzing this graph, it is possible to establish if the problem is “solvable” in the sense that there exists a unique (up to a single projective transformation) set of cameras that are compliant with the given fundamental matrices. In this paper, we take several steps forward in the study of viewing graph solvability: we propose a new formulation of the problem that is more direct than previous literature, based on a formula that explicitly links pairs of cameras via their fundamental matrix; we introduce the new concept of “infinitesimal solvability”, demonstrating its usefulness in understanding real structure from motion graphs; we propose an algorithm for testing infinitesimal solvability and extracting components of unsolvable cases, that is more efficient than previous work; we set up an open question on the connection between infinitesimal solvability and solvability.

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/EH22_008%2F0004590" target="_blank" >EH22_008/0004590: Robotika a pokročilá průmyslová výroba</a><br>

Návaznosti

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

Rok uplatnění

2025

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

Computer Vision – ECCV 2024 18th European Conference, Milan, Italy, September 29–October 4, 2024, Proceedings, Part I

ISBN

978-3-031-73231-7

ISSN

0302-9743

e-ISSN

1611-3349

Počet stran výsledku

16

Strana od-do

319-334

Název nakladatele

Springer

Místo vydání

Cham

Místo konání akce

Milano

Datum konání akce

29. 9. 2024

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

WRD - Celosvětová akce

Kód UT WoS článku

001346378300018