<title>Examples of basis pursuit</title>

Scott Chen, David L. DonohoProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE 1995 · DOI

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 l<SUP>1</SUP> 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.
BibTeX
@inproceedings{chen1995lt,
  author = {Scott Chen and David L. Donoho},
  title = {{\&lt;title\&gt;Examples of basis pursuit\&lt;/title\&gt;}},
  booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
  year = {1995},
  doi = {10.1117/12.217610},
}

Loading related content...

Figure