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

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

Namespace Prefixes

PrefixIRI
n12http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n17http://purl.org/net/nknouf/ns/bibtex#
n5http://localhost/temp/predkladatel/
n14http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F08%3A03150844%21RIV09-MSM-21230___/
n7http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n13http://linked.opendata.cz/ontology/domain/vavai/
n19http://linked.opendata.cz/resource/domain/vavai/zamer/
n16https://schema.org/
shttp://schema.org/
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#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n21http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n4http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F08%3A03150844%21RIV09-MSM-21230___
rdf:type
skos:Concept n13:Vysledek
dcterms:description
In this paper we provide new fast and simple solutions to two important minimal problems in computer vision, the five-point relative pose problem and the six-point focal length problem. We show that these two problems can easily be formulated as polynomial eigenvalue problems of degree three and two and solved using standard efficient numerical algorithms. Our solutions are somewhat more stable than state-of-the-art solutions by Nister and Stewenius and are in some sense more straightforward and easier to implement since polynomial eigenvalue problems are well studied with many efficient and robust algorithms available. The quality of the solvers is demonstrated in experiments. In this paper we provide new fast and simple solutions to two important minimal problems in computer vision, the five-point relative pose problem and the six-point focal length problem. We show that these two problems can easily be formulated as polynomial eigenvalue problems of degree three and two and solved using standard efficient numerical algorithms. Our solutions are somewhat more stable than state-of-the-art solutions by Nister and Stewenius and are in some sense more straightforward and easier to implement since polynomial eigenvalue problems are well studied with many efficient and robust algorithms available. The quality of the solvers is demonstrated in experiments. In this paper we provide new fast and simple solutions to two important minimal problems in computer vision, the five-point relative pose problem and the six-point focal length problem. We show that these two problems can easily be formulated as polynomial eigenvalue problems of degree three and two and solved using standard efficient numerical algorithms. Our solutions are somewhat more stable than state-of-the-art solutions by Nister and Stewenius and are in some sense more straightforward and easier to implement since polynomial eigenvalue problems are well studied with many efficient and robust algorithms available. The quality of the solvers is demonstrated in experiments.
dcterms:title
Polynomial Eigenvalue Solutions to the 5-pt and 6-pt Relative Pose Problems Polynomial Eigenvalue Solutions to the 5-pt and 6-pt Relative Pose Problems Polynomial Eigenvalue Solutions to the 5-pt and 6-pt Relative Pose Problems
skos:prefLabel
Polynomial Eigenvalue Solutions to the 5-pt and 6-pt Relative Pose Problems Polynomial Eigenvalue Solutions to the 5-pt and 6-pt Relative Pose Problems Polynomial Eigenvalue Solutions to the 5-pt and 6-pt Relative Pose Problems
skos:notation
RIV/68407700:21230/08:03150844!RIV09-MSM-21230___
n3:aktivita
n21:Z
n3:aktivity
Z(MSM6840770038)
n3:dodaniDat
n4:2009
n3:domaciTvurceVysledku
n7:6349390 n7:6479243 n7:6245269
n3:druhVysledku
n9:D
n3:duvernostUdaju
n18:S
n3:entitaPredkladatele
n14:predkladatel
n3:idSjednocenehoVysledku
387447
n3:idVysledku
RIV/68407700:21230/08:03150844
n3:jazykVysledku
n8:eng
n3:klicovaSlova
5pt problem; 6pt problem; minimal problems; polynomial eigenvalue problem; relative pose
n3:klicoveSlovo
n6:minimal%20problems n6:relative%20pose n6:6pt%20problem n6:polynomial%20eigenvalue%20problem n6:5pt%20problem
n3:kontrolniKodProRIV
[7B4E43600D2B]
n3:mistoKonaniAkce
Leeds
n3:mistoVydani
London
n3:nazevZdroje
BMVC 2008: Proceedings of the 19th British Machine Vision Conference
n3:obor
n20:JD
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:rokUplatneniVysledku
n4:2008
n3:tvurceVysledku
Pajdla, Tomáš Bujňák, Martin Kúkelová, Zuzana
n3:typAkce
n12:WRD
n3:zahajeniAkce
2008-09-01+02:00
n3:zamer
n19:MSM6840770038
s:numberOfPages
10
n17:hasPublisher
British Machine Vision Association
n16:isbn
978-1-901725-36-0
n5:organizacniJednotka
21230