Affine Reconstruction Based on Affinely Corresponding Point Sets

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

Result language
angličtina
Original language name
Affine Reconstruction Based on Affinely Corresponding Point Sets
Original language description
In this paper we discuss the following observation: Suppose we are given a projective reconstruction Sp of a point set S, in which we can identify subsets Xp subset Sp and Yp subset Sp. Suppose we know that the X and Y must be mutually related by an (unknown) affine mapping Y = Ha X in S. Then it is possible to upgrade Sp to affine reconstruction. We show this problem has up to four solutions. If the internal camera parameters are known to be equal it is possible to choose a single solution. A simple experiment on simulated and real data shows that the problem is numerically feasible.
Czech name
—
Czech description
—

Project
<a href="/en/project/ME%20412" target="_blank" >ME 412: Computer Vision based 3D scene representation, reconstruction, and visualisation</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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
Computer Vision - CVWW'03 : Proceedings of the 8th Computer Vision Winter Workshop
ISBN
80-238-9967-8
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
73-76
Publisher name
Czech Pattern Recognition Society
Place of publication
Prague
Event location
Valtice
Event date
Feb 3, 2003
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)