liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The Application of an Oblique-Projected Landweber Method to a Model of Supervised Learning
Linköping University, Department of Electrical Engineering, Computer Vision. Linköping University, The Institute of Technology.
Linköping University, Department of Mathematics, Scientific Computing. Linköping University, The Institute of Technology.
Linköping University, Department of Mathematics, Applied Mathematics. Linköping University, The Institute of Technology.
Department of Mathematics, University of Haifa, Mt. Carmel, Haifa 31905, Israel.
Show others and affiliations
2004 (English)Report (Other academic)
Abstract [en]

This report brings together a novel approach to some computer vision problems and a particular algorithmic development of the Landweber iterative algorithm. The algorithm solves a class of high-dimensional, sparse, and constrained least-squares problems, which arise in various computer vision learning tasks, such as object recognition and object pose estimation. The algorithm has recently been applied to these problems, but it has been used rather heuristically. In this report we describe the method and put it on firm mathematical ground. We consider a convexly constrained weighted least-squares problem and propose for its solution a projected Landweber method which employs oblique projections onto the closed convex constraint set. We formulate the problem, present the algorithm and work out its convergence properties, including a rate-of-convergence result. The results are put in perspective of currently available projected Landweber methods. The application to supervised learning is described, and the method is evaluated in a function approximation experiment.

Place, publisher, year, edition, pages
2004. , 36 p.
Series
LiTH-ISY-R, ISSN 1400-3902 ; 2623
Keyword [en]
Projected Landweber, preconditioner, nonnegative constraint, supervised learning, channel representation
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-24052ISRN: LiTH-ISY-R-2623Local ID: 3610OAI: oai:DiVA.org:liu-24052DiVA: diva2:244368
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2014-08-28Bibliographically approved

Open Access in DiVA

No full text

Authority records BETA

Johansson, BjörnElfving, TommyKozlov, VladimirGranlund, Gösta

Search in DiVA

By author/editor
Johansson, BjörnElfving, TommyKozlov, VladimirGranlund, Gösta
By organisation
Computer VisionThe Institute of TechnologyScientific ComputingApplied MathematicsDepartment of Electrical Engineering
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 534 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf