Open Access Paper
13 September 2007 A wide-angle view at iterated shrinkage algorithms
M. Elad, B. Matalon, J. Shtok, M. Zibulevsky
Author Affiliations +
Abstract
Sparse and redundant representations − an emerging and powerful model for signals − suggests that a data source could be described as a linear combination of few atoms from a pre-specified and over-complete dictionary. This model has drawn a considerable attention in the past decade, due to its appealing theoretical foundations, and promising practical results it leads to. Many of the applications that use this model are formulated as a mixture of l2-lp (p ≤ 1) optimization expressions. Iterated Shrinkage algorithms are a new family of highly effective numerical techniques for handling these optimization tasks, surpassing traditional optimization techniques. In this paper we aim to give a broad view of this group of methods, motivate their need, present their derivation, show their comparative performance, and most important of all, discuss their potential in various applications.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
M. Elad, B. Matalon, J. Shtok, and M. Zibulevsky "A wide-angle view at iterated shrinkage algorithms", Proc. SPIE 6701, Wavelets XII, 670102 (13 September 2007); https://doi.org/10.1117/12.741299
Lens.org Logo
CITATIONS
Cited by 100 scholarly publications and 1 patent.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Expectation maximization algorithms

Optimization (mathematics)

Algorithm development

Associative arrays

Denoising

Algorithms

Chemical species

Back to Top