Combinatorial Constraints on Multiple Projections of a Set of Points

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F03%3A03091319" target="_blank" >RIV/68407700:21230/03:03091319 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Combinatorial Constraints on Multiple Projections of a Set of Points
Original language description
Multiple projections of a scene cannot be arbitrary, the allowed configurations being given by matching constraints. This paper presents new matching constraints on multiple projections of a rigid point set by uncalibrated cameras, obtained by formulation in the oriented projective rather than projective geometry. They follow from consistency of orientations of camera rays and from the fact that the scene is the affine rather that projective space. For their non-parametric nature, we call them combinatorial. The constraints are derived in a unified theoretical framework using the theory of oriented matroids. For example, we present constraints on 4 point correspondences for 2D camera resectioning, on 3 correspondences in two 1D cameras, and on 4 correspondences in two 2D cameras.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)

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

Article name in the collection
ICCV 2003: Proceedings of the 9th International Conference on Computer Vision
ISBN
0-7695-1950-4
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
1011-1016
Publisher name
IEEE Computer Society Press
Place of publication
Los Alamitos
Event location
Nice
Event date
Oct 13, 2003
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)