Change search
ReferencesLink to record
Permanent link

Direct link
Adaptive least squares matching as a non-linear least squares optimization problem
Umeå University, Faculty of Science and Technology, Department of Computing Science.ORCID iD: 0000-0002-7657-6917
2002 (English)In: Proceedings SSAB 2002: symposium on Image Analysis, 2002Conference paper (Other academic)
Abstract [en]

Adaptive Least Squares Matching (ALSM) is a powerful technique for precisely locating objects in digital images. The method was introduced to the photogrammetric community by Gruen in 1985 and has since been developed further. The purpose of this paper is to study the basic ALSM formulation from a least squares optimization point of view. It turns out that it is possible to describe the basic algorithm as a variation of the Gauss-Newton method for solving weighted non-linear least squares optimization problems. This opens the possibility of applying optimization theory on the ALSM problem. The line-search algorithm for obtaining global convergence is especially described and illustrated

Place, publisher, year, edition, pages
Keyword [en]
Least squares matching, Gauss-Newton algorithm, Photogrammetry, Line search algorithms
URN: urn:nbn:se:umu:diva-40120OAI: diva2:397992
SSAB´02, Swedish symposium on Image Analysis, 2002 års Svenska Symposium i Bildanalys, 7-8 mars, LTH, Lund
Available from: 2011-02-16 Created: 2011-02-16 Last updated: 2014-06-11Bibliographically approved

Open Access in DiVA

fulltext(124 kB)122 downloads
File information
File name FULLTEXT02.pdfFile size 124 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Börlin, Niclas
By organisation
Department of Computing Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 122 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 62 hits
ReferencesLink to record
Permanent link

Direct link