This HTML5 document contains 41 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n14http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n16http://localhost/temp/predkladatel/
n5http://purl.org/net/nknouf/ns/bibtex#
n18http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://linked.opendata.cz/resource/domain/vavai/projekt/
n21http://linked.opendata.cz/ontology/domain/vavai/
n10https://schema.org/
shttp://schema.org/
n12http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F03%3A03087062%21RIV%2F2004%2FMSM%2F212304%2FN/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n9http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F03%3A03087062%21RIV%2F2004%2FMSM%2F212304%2FN
rdf:type
skos:Concept n21:Vysledek
dcterms: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. 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.
dcterms:title
Affine Reconstruction Based on Affinely Corresponding Point Sets Affine Reconstruction Based on Affinely Corresponding Point Sets
skos:prefLabel
Affine Reconstruction Based on Affinely Corresponding Point Sets Affine Reconstruction Based on Affinely Corresponding Point Sets
skos:notation
RIV/68407700:21230/03:03087062!RIV/2004/MSM/212304/N
n3:strany
73 ; 76
n3:aktivita
n8:P
n3:aktivity
P(ME 412)
n3:dodaniDat
n6:2004
n3:domaciTvurceVysledku
n18:8930112
n3:druhVysledku
n11:D
n3:duvernostUdaju
n19:S
n3:entitaPredkladatele
n12:predkladatel
n3:idSjednocenehoVysledku
597585
n3:idVysledku
RIV/68407700:21230/03:03087062
n3:jazykVysledku
n13:eng
n3:klicovaSlova
computer vision;structure reconstruction
n3:klicoveSlovo
n9:computer%20vision n9:structure%20reconstruction
n3:kontrolniKodProRIV
[271C75C7FCF9]
n3:mistoKonaniAkce
Valtice
n3:mistoVydani
Prague
n3:nazevZdroje
Computer Vision - CVWW'03 : Proceedings of the 8th Computer Vision Winter Workshop
n3:obor
n17:JD
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:projekt
n15:ME%20412
n3:rokUplatneniVysledku
n6:2003
n3:tvurceVysledku
Zhang, H. Wu, F. Šára, Radim
n3:typAkce
n14:EUR
n3:zahajeniAkce
2003-02-03+01:00
s:numberOfPages
4
n5:hasPublisher
Czech Pattern Recognition Society
n10:isbn
80-238-9967-8
n16:organizacniJednotka
21230