About: Polynomial Eigenvalue Solutions to the 5-pt and 6-pt Relative Pose Problems     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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. (en)
  • 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. (cs)
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 (en)
  • Polynomial Eigenvalue Solutions to the 5-pt and 6-pt Relative Pose Problems (cs)
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 (en)
  • Polynomial Eigenvalue Solutions to the 5-pt and 6-pt Relative Pose Problems (cs)
skos:notation
  • RIV/68407700:21230/08:03150844!RIV09-MSM-21230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM6840770038)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 387447
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/08:03150844
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • 5pt problem; 6pt problem; minimal problems; polynomial eigenvalue problem; relative pose (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [7B4E43600D2B]
http://linked.open...v/mistoKonaniAkce
  • Leeds
http://linked.open...i/riv/mistoVydani
  • London
http://linked.open...i/riv/nazevZdroje
  • BMVC 2008: Proceedings of the 19th British Machine Vision Conference
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Bujňák, Martin
  • Kúkelová, Zuzana
  • Pajdla, Tomáš
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • British Machine Vision Association
https://schema.org/isbn
  • 978-1-901725-36-0
http://localhost/t...ganizacniJednotka
  • 21230
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software