A wide-angle view at iterated shrinkage algorithms
Lists
Only you see this
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 <i>l<sub>2</sub>-l<sub>p</sub></i> (<i>p</i> ≤ 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.
BibTeX
@inproceedings{elad2007wide,
author = {Michael Elad and Boaz Matalon and Joseph Shtok and Michael Zibulevsky},
title = {{A wide-angle view at iterated shrinkage algorithms}},
booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
year = {2007},
doi = {10.1117/12.741299},
}Loading related content...