Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published July 24, 2006 | public
Book Section - Chapter Open

Sparse Approximation Via Iterative Thresholding

Abstract

The well-known shrinkage technique is still relevant for contemporary signal processing problems over redundant dictionaries. We present theoretical and empirical analyses for two iterative algorithms for sparse approximation that use shrinkage. The GENERAL IT algorithm amounts to a Landweber iteration with nonlinear shrinkage at each iteration step. The BLOCK IT algorithm arises in morphological components analysis. A sufficient condition for which General IT exactly recovers a sparse signal is presented, in which the cumulative coherence function naturally arises. This analysis extends previous results concerning the Orthogonal Matching Pursuit (OMP) and Basis Pursuit (BP) algorithms to IT algorithms.

Additional Information

© Copyright 2006 IEEE. Reprinted with permission. [Posted online: 2006-07-24]

Files

HERicassp06.pdf
Files (133.2 kB)
Name Size Download all
md5:be8210a62662cafbd6ac67d2ac3bcf41
133.2 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
August 22, 2023