## A wide-angle view at iterated shrinkage algorithms (2007)

Venue: | in SPIE (Wavelet XII |

Citations: | 25 - 1 self |

### BibTeX

@INPROCEEDINGS{Elad07awide-angle,

author = {M. Elad and B. Matalon and J. Shtok and M. Zibulevsky},

title = {A wide-angle view at iterated shrinkage algorithms},

booktitle = {in SPIE (Wavelet XII},

year = {2007},

pages = {26--29}

}

### OpenURL

### 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 ℓ2-ℓp (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.