Arbitrary Shrinkage Rules for Approximation Schemes with Sparsity Constraints

Ehler, Martin; Geisel, Simone

doi:10.4230/DagSemProc.08492.5

Document

Arbitrary Shrinkage Rules for Approximation Schemes with Sparsity Constraints

Authors Martin Ehler, Simone Geisel

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 8492
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2009-02-24

PDF

File

PDF

DagSemProc.08492.5.pdf

Filesize: 242 kB
12 pages

Document Identifiers

DOI: 10.4230/DagSemProc.08492.5
URN: urn:nbn:de:0030-drops-18816

Subject Classification

Keywords

Frames
shrinkage
variational problems
sparse approximation

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

Finding a sparse representation of a possibly noisy signal is a common problem in signal  representation and processing. It can be modeled as a variational minimization with $ell_	au$-sparsity constraints for $	au<1$. Applications whose computation time is crucial require fast algorithms for this minimization. However, there are no fast methods for finding the exact minimizer, and to circumvent this limitation, we consider minimization up to a constant factor. We verify that arbitrary shrinkage rules provide closed formulas for such minimizers, and we introduce a new shrinkage strategy, which is adapted to $	au<1$.

Cite As Get BibTex

Martin Ehler and Simone Geisel. Arbitrary Shrinkage Rules for Approximation Schemes with Sparsity Constraints. In Structured Decompositions and Efficient Algorithms. Dagstuhl Seminar Proceedings, Volume 8492, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009) https://doi.org/10.4230/DagSemProc.08492.5

Author Details

Martin Ehler

Simone Geisel

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail