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”

PL1P: Point-Line Minimal Problems under Partial Visibility in Three Views

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F24%3A00388118" target="_blank" >RIV/68407700:21730/24:00388118 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1007/s11263-024-01992-1" target="_blank" >https://doi.org/10.1007/s11263-024-01992-1</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s11263-024-01992-1" target="_blank" >10.1007/s11263-024-01992-1</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    PL1P: Point-Line Minimal Problems under Partial Visibility in Three Views

  • Original language description

    We present a complete classification of minimal problems for generic arrangements of points and lines in space observed partially by three calibrated perspective cameras when each line is incident to at most one point. This is a large class of interesting minimal problems that allows missing observations in images due to occlusions and missed detections. There is an infinite number of such minimal problems; however, we show that they can be reduced to 140,616 equivalence classes by removing superfluous features and relabeling the cameras. We also introduce camera-minimal problems, which are practical for designing minimal solvers, and show how to pick a simplest camera-minimal problem for each minimal problem. This simplification results in 74,575 equivalence classes. Only 76 of these were known; the rest are new. To identify problems having potential for practical solving of image matching and 3D reconstruction, we present several natural subfamilies of camera-minimal problems as well as compute solution counts for all camera-minimal problems which have fewer than 300 solutions for generic data.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • 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

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

Others

  • Publication year

    2024

  • 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

  • Name of the periodical

    International Journal of Computer Vision

  • ISSN

    0920-5691

  • e-ISSN

    1573-1405

  • Volume of the periodical

    132

  • Issue of the periodical within the volume

    8

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    22

  • Pages from-to

    3302-3323

  • UT code for WoS article

    001178737000001

  • EID of the result in the Scopus database

    2-s2.0-85187138177