Multilinear model estimation with L2-regularization

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandAufsatz in KonferenzbandForschungPeer-Review

Autoren

Externe Organisationen

  • Western University
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Titel des SammelwerksPattern Recognition
Untertitel33rd DAGM Symposium, Proceedings
Seiten81-90
Seitenumfang10
PublikationsstatusVeröffentlicht - 2011
Veranstaltung33rd Annual Symposium of German Pattern Recognition Association, DAGM 2011 - Frankfurt/Main, Deutschland
Dauer: 31 Aug. 20112 Sept. 2011

Publikationsreihe

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Band6835 LNCS
ISSN (Print)0302-9743
ISSN (elektronisch)1611-3349

Abstract

Many challenging computer vision problems can be formulated as a multilinear model. Classical methods like principal component analysis use singular value decomposition to infer model parameters. Although it can solve a given problem easily if all measurements are known this prerequisite is usually violated for computer vision applications. In the current work, a standard tool to estimate singular vectors under incomplete data is reformulated as an energy minimization problem. This admits for a simple and fast gradient descent optimization with guaranteed convergence. Furthermore, the energy function is generalized by introducing an L 2-regularization on the parameter space. We show a quantitative and qualitative evaluation of the proposed approach on an application from structure-from-motion using synthetic and real image data, and compare it with other works.

ASJC Scopus Sachgebiete

Zitieren

Multilinear model estimation with L2-regularization. / Schmidt, Frank R.; Ackermann, Hanno; Rosenhahn, Bodo.
Pattern Recognition: 33rd DAGM Symposium, Proceedings. 2011. S. 81-90 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 6835 LNCS).

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandAufsatz in KonferenzbandForschungPeer-Review

Schmidt, FR, Ackermann, H & Rosenhahn, B 2011, Multilinear model estimation with L2-regularization. in Pattern Recognition: 33rd DAGM Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 6835 LNCS, S. 81-90, 33rd Annual Symposium of German Pattern Recognition Association, DAGM 2011, Frankfurt/Main, Deutschland, 31 Aug. 2011. https://doi.org/10.1007/978-3-642-23123-0_9
Schmidt, F. R., Ackermann, H., & Rosenhahn, B. (2011). Multilinear model estimation with L2-regularization. In Pattern Recognition: 33rd DAGM Symposium, Proceedings (S. 81-90). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 6835 LNCS). https://doi.org/10.1007/978-3-642-23123-0_9
Schmidt FR, Ackermann H, Rosenhahn B. Multilinear model estimation with L2-regularization. in Pattern Recognition: 33rd DAGM Symposium, Proceedings. 2011. S. 81-90. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-23123-0_9
Schmidt, Frank R. ; Ackermann, Hanno ; Rosenhahn, Bodo. / Multilinear model estimation with L2-regularization. Pattern Recognition: 33rd DAGM Symposium, Proceedings. 2011. S. 81-90 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Download
@inproceedings{49c6f65d5fad4d228c071634980c319f,
title = "Multilinear model estimation with L2-regularization",
abstract = "Many challenging computer vision problems can be formulated as a multilinear model. Classical methods like principal component analysis use singular value decomposition to infer model parameters. Although it can solve a given problem easily if all measurements are known this prerequisite is usually violated for computer vision applications. In the current work, a standard tool to estimate singular vectors under incomplete data is reformulated as an energy minimization problem. This admits for a simple and fast gradient descent optimization with guaranteed convergence. Furthermore, the energy function is generalized by introducing an L 2-regularization on the parameter space. We show a quantitative and qualitative evaluation of the proposed approach on an application from structure-from-motion using synthetic and real image data, and compare it with other works.",
author = "Schmidt, {Frank R.} and Hanno Ackermann and Bodo Rosenhahn",
year = "2011",
doi = "10.1007/978-3-642-23123-0_9",
language = "English",
isbn = "9783642231223",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "81--90",
booktitle = "Pattern Recognition",
note = "33rd Annual Symposium of German Pattern Recognition Association, DAGM 2011 ; Conference date: 31-08-2011 Through 02-09-2011",

}

Download

TY - GEN

T1 - Multilinear model estimation with L2-regularization

AU - Schmidt, Frank R.

AU - Ackermann, Hanno

AU - Rosenhahn, Bodo

PY - 2011

Y1 - 2011

N2 - Many challenging computer vision problems can be formulated as a multilinear model. Classical methods like principal component analysis use singular value decomposition to infer model parameters. Although it can solve a given problem easily if all measurements are known this prerequisite is usually violated for computer vision applications. In the current work, a standard tool to estimate singular vectors under incomplete data is reformulated as an energy minimization problem. This admits for a simple and fast gradient descent optimization with guaranteed convergence. Furthermore, the energy function is generalized by introducing an L 2-regularization on the parameter space. We show a quantitative and qualitative evaluation of the proposed approach on an application from structure-from-motion using synthetic and real image data, and compare it with other works.

AB - Many challenging computer vision problems can be formulated as a multilinear model. Classical methods like principal component analysis use singular value decomposition to infer model parameters. Although it can solve a given problem easily if all measurements are known this prerequisite is usually violated for computer vision applications. In the current work, a standard tool to estimate singular vectors under incomplete data is reformulated as an energy minimization problem. This admits for a simple and fast gradient descent optimization with guaranteed convergence. Furthermore, the energy function is generalized by introducing an L 2-regularization on the parameter space. We show a quantitative and qualitative evaluation of the proposed approach on an application from structure-from-motion using synthetic and real image data, and compare it with other works.

UR - http://www.scopus.com/inward/record.url?scp=80053024337&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-23123-0_9

DO - 10.1007/978-3-642-23123-0_9

M3 - Conference contribution

AN - SCOPUS:80053024337

SN - 9783642231223

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 81

EP - 90

BT - Pattern Recognition

T2 - 33rd Annual Symposium of German Pattern Recognition Association, DAGM 2011

Y2 - 31 August 2011 through 2 September 2011

ER -

Von denselben Autoren