Share Email Print

Proceedings Paper

Examples of basis pursuit
Author(s): Scott Chen; David L. Donoho
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The Time-Frequency and Time-Scale communities have recently developed a large number of overcomplete waveform dictionaries. Decomposition into overcomplete systems is not unique, and several methods for decomposition have been proposed--including the Method of Frames, Matching Pursuit, and, for special dictionaries, the Best Orthogonal Basis. Basis Pursuit is a principle for decomposing a signal into an `optimal' superposition of dictionary elements-- where optimal means having the smallest l1 norm of coefficients among all such decompositions. We give examples exhibiting several advantages over the Method of Frames, Matching Pursuit and Best Ortho Basis, including better sparsity, and super-resolution. Basis Pursuit in highly overcomplete dictionaries leads to large-scale optimization problems. We obtain reasonable success with a primal-dual logarithmic barrier method and conjugate gradient solver.

Paper Details

Date Published: 1 September 1995
PDF: 11 pages
Proc. SPIE 2569, Wavelet Applications in Signal and Image Processing III, (1 September 1995); doi: 10.1117/12.217610
Show Author Affiliations
Scott Chen, Stanford Univ. (United States)
David L. Donoho, Stanford Univ. (United States)

Published in SPIE Proceedings Vol. 2569:
Wavelet Applications in Signal and Image Processing III
Andrew F. Laine; Michael A. Unser, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?