PLMP – Point-Line Minimal Problems in Complete Multi-View Visibility
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F24%3A00371870" target="_blank" >RIV/68407700:21730/24:00371870 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1109/TPAMI.2023.3324728" target="_blank" >https://doi.org/10.1109/TPAMI.2023.3324728</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TPAMI.2023.3324728" target="_blank" >10.1109/TPAMI.2023.3324728</a>
Alternative languages
Result language
angličtina
Original language name
PLMP – Point-Line Minimal Problems in Complete Multi-View Visibility
Original language description
We present a complete classification of all minimal problems for generic arrangements of points and lines completely observed by calibrated perspective cameras. We show that there are only 30 minimal problems in total, no problems exist for more than 6 cameras, for more than 5 points, and for more than 6 lines. We present a sequence of tests for detecting minimality starting with counting degrees of freedom and ending with full symbolic and numeric verification of representative examples. For all minimal problems discovered, we present their algebraic degrees, i.e.the number of solutions, which measure their intrinsic difficulty. It shows how exactly the difficulty of problems grows with the number of views. Importantly, several new minimal problems have small degrees that might be practical in image matching and 3D reconstruction.
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
IEEE Transactions on Pattern Analysis and Machine Intelligence
ISSN
0162-8828
e-ISSN
1939-3539
Volume of the periodical
46
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
15
Pages from-to
421-435
UT code for WoS article
001123923900022
EID of the result in the Scopus database
2-s2.0-85174851424