umu.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Pros and cons of constrained and unconstrained formulation of the bundle adjustment problem
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.ORCID-id: 0000-0002-7657-6917
National Institute of Applied Sciences of Strasbourg. (MAP-PAGE UMR 694)
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
2004 (Engelska)Ingår i: ISPRS Congress Istanbul 2004, Proceedings of Commission III, ISPRS , 2004, Vol. XXXV, nr B3, s. 589-594Konferensbidrag, Publicerat paper (Övrigt vetenskapligt)
Abstract [en]

Two implementations of the bundle adjustment problem were applied to a subset of the Zurich City Hall reference data set. One implementation used the standard Euler angle parameterisation of the rotation matrix. The second implementation used all nine elements of the rotation matrix as unknowns and six functional constraints. The second formulation was constructed to reduce the non-linearity of the optimisation problem. The hypothesis was that a lower degree of non-linearity would lead to faster convergence. Furthermore, each implementation could optionally use the line search damping technique known from optimisation theory. The algorithms were used to solve the relative orientation problem for a varying number of homologous points from 33 different camera pairs. The results show that the constrained formulation has marginally better convergence properties, with or without damping. However, damping alone halves the number of convergence failures at a minor computational cost. The conclusion is that except to avoid the singularities associated with the Euler angles, the preferred use of the constrained formulation remains an open question. However, the results strongly suggest that the line search damping technique should be included in standard implementations of the bundle adjustment algorithm.

Ort, förlag, år, upplaga, sidor
ISPRS , 2004. Vol. XXXV, nr B3, s. 589-594
Serie
ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, ISSN 1682-1750 ; Vol 35 part B3
Nyckelord [en]
Algorithms, mathematics, bundle, generalisation, modelling, performance, reliability
Identifikatorer
URN: urn:nbn:se:umu:diva-40126OAI: oai:DiVA.org:umu-40126DiVA, id: diva2:397969
Konferens
Geo-Imagery Bridging Continents XXth ISPRS Congress, 12-23 July 2004 Istanbul, Turkey Commission 3
Tillgänglig från: 2011-02-17 Skapad: 2011-02-16 Senast uppdaterad: 2018-06-08Bibliografiskt granskad

Open Access i DiVA

fulltext(272 kB)127 nedladdningar
Filinformation
Filnamn FULLTEXT02.pdfFilstorlek 272 kBChecksumma SHA-512
35321251b80e68bd174fc490300c70c73284819ca643b363fe2e8edd7b98559e9c6cac1b1a12958c70bb9f4cadd883753292d97be94679bb65d96bd9c4938225
Typ fulltextMimetyp application/pdf

Personposter BETA

Börlin, NiclasEriksson, JerryLindström, Per

Sök vidare i DiVA

Av författaren/redaktören
Börlin, NiclasEriksson, JerryLindström, Per
Av organisationen
Institutionen för datavetenskap

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 127 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 478 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf