A splitting algorithm for directional regularization and sparsification

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

Standard

A splitting algorithm for directional regularization and sparsification. / Rakêt, Lars Lau; Nielsen, Mads.

Proceedings of the 21st International Conference on Pattern Recognition (ICPR). IEEE, 2012. s. 3094-3098.

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

Harvard

Rakêt, LL & Nielsen, M 2012, A splitting algorithm for directional regularization and sparsification. i Proceedings of the 21st International Conference on Pattern Recognition (ICPR). IEEE, s. 3094-3098, International Conference on Pattern Recognition, Tsukuba, Japan, 11/11/2012. <http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6460819&abstractAccess=no&userType=inst>

APA

Rakêt, L. L., & Nielsen, M. (2012). A splitting algorithm for directional regularization and sparsification. I Proceedings of the 21st International Conference on Pattern Recognition (ICPR) (s. 3094-3098). IEEE. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6460819&abstractAccess=no&userType=inst

Vancouver

Rakêt LL, Nielsen M. A splitting algorithm for directional regularization and sparsification. I Proceedings of the 21st International Conference on Pattern Recognition (ICPR). IEEE. 2012. s. 3094-3098

Author

Rakêt, Lars Lau ; Nielsen, Mads. / A splitting algorithm for directional regularization and sparsification. Proceedings of the 21st International Conference on Pattern Recognition (ICPR). IEEE, 2012. s. 3094-3098

Bibtex

@inproceedings{de3886bd037643f598fcc03d66c12ccd,
title = "A splitting algorithm for directional regularization and sparsification",
abstract = "We present a new split-type algorithm for the minimization of a p-harmonic energy with added data fidelity term. The half-quadratic splitting reduces the original problem to two straightforward problems, that can be minimized efficiently. The minimizers to the two sub-problems can typically be computed pointwise and are easily implemented on massively parallel processors. Furthermore the splitting method allows for the computation of solutions to a large number of more advanced directional regularization problems. In particular we are able to handle robust, non-convex data terms, and to define a 0-harmonic regularization energy where we sparsify directions by means of an L0 norm.",
author = "Rak{\^e}t, {Lars Lau} and Mads Nielsen",
year = "2012",
language = "English",
isbn = "978-4-9906441-0-9",
pages = "3094--3098",
booktitle = "Proceedings of the 21st International Conference on Pattern Recognition (ICPR)",
publisher = "IEEE",
note = "null ; Conference date: 11-11-2012 Through 15-11-2012",

}

RIS

TY - GEN

T1 - A splitting algorithm for directional regularization and sparsification

AU - Rakêt, Lars Lau

AU - Nielsen, Mads

N1 - Conference code: 21

PY - 2012

Y1 - 2012

N2 - We present a new split-type algorithm for the minimization of a p-harmonic energy with added data fidelity term. The half-quadratic splitting reduces the original problem to two straightforward problems, that can be minimized efficiently. The minimizers to the two sub-problems can typically be computed pointwise and are easily implemented on massively parallel processors. Furthermore the splitting method allows for the computation of solutions to a large number of more advanced directional regularization problems. In particular we are able to handle robust, non-convex data terms, and to define a 0-harmonic regularization energy where we sparsify directions by means of an L0 norm.

AB - We present a new split-type algorithm for the minimization of a p-harmonic energy with added data fidelity term. The half-quadratic splitting reduces the original problem to two straightforward problems, that can be minimized efficiently. The minimizers to the two sub-problems can typically be computed pointwise and are easily implemented on massively parallel processors. Furthermore the splitting method allows for the computation of solutions to a large number of more advanced directional regularization problems. In particular we are able to handle robust, non-convex data terms, and to define a 0-harmonic regularization energy where we sparsify directions by means of an L0 norm.

M3 - Article in proceedings

SN - 978-4-9906441-0-9

SP - 3094

EP - 3098

BT - Proceedings of the 21st International Conference on Pattern Recognition (ICPR)

PB - IEEE

Y2 - 11 November 2012 through 15 November 2012

ER -

ID: 38468530