All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Viewing Graph Solvability in Practice

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F23%3A00372023" target="_blank" >RIV/68407700:21730/23:00372023 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/ICCV51070.2023.00748" target="_blank" >https://doi.org/10.1109/ICCV51070.2023.00748</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Viewing Graph Solvability in Practice

  • Original language description

    We present an advance in understanding the projective Structure-from-Motion, focusing in particular on the viewing graph: such a graph has cameras as nodes and fundamental matrices as edges. We propose a practical method for testing finite solvability, i.e., whether a viewing graph induces a finite number of camera configurations. Our formulation uses a significantly smaller number of equations (up to 400x) with respect to previous work. As a result, this is the only method in the literature that can be applied to large viewing graphs coming from real datasets, comprising up to 300K edges. In addition, we develop the first algorithm for identifying maximal finite-solvable components.

  • Czech name

  • Czech description

Classification

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

Result continuities

  • Project

  • Continuities

    R - Projekt Ramcoveho programu EK

Others

  • Publication year

    2023

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    ICCV2023: Proceedings of the International Conference on Computer Vision

  • ISBN

    979-8-3503-0719-1

  • ISSN

    1550-5499

  • e-ISSN

    2380-7504

  • Number of pages

    9

  • Pages from-to

    8113-8121

  • Publisher name

    IEEE

  • Place of publication

    Piscataway

  • Event location

    Paris

  • Event date

    Oct 2, 2023

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    001169499000028