• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

ATOMIC DECOMPOSITION BY BASIS PURSUIT (1995)

Cached

  • Download as a PDF

Download Links

  • [www-stat.stanford.edu]
  • [redwood.psych.cornell.edu]
  • [www.cns.nyu.edu]
  • [www.informatik.uni-bonn.de]
  • [www-stat.stanford.edu]
  • [www.stanford.edu]
  • [home.ustc.edu.cn]
  • [www-leland.stanford.edu]
  • [www-leland.stanford.edu]
  • [home.ustc.edu.cn]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Scott Shaobing Chen , David L. Donoho , Michael A. Saunders
Citations:2717 - 61 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Chen95atomicdecomposition,
    author = {Scott Shaobing Chen and David L. Donoho and Michael A. Saunders},
    title = {ATOMIC DECOMPOSITION BY BASIS PURSUIT },
    year = {1995}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

The Time-Frequency and Time-Scale communities have recently developed a large number of overcomplete waveform dictionaries -- stationary wavelets, wavelet packets, cosine packets, chirplets, and warplets, to name a few. Decomposition into overcomplete systems is not unique, and several methods for decomposition have been proposed, including the Method of Frames (MOF), Matching Pursuit (MP), and, for special dictionaries, the Best Orthogonal Basis (BOB). Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l 1 norm of coefficients among all such decompositions. We give examples exhibiting several advantages over MOF, MP and BOB, including better sparsity, and super-resolution. BP has interesting relations to ideas in areas as diverse as ill-posed problems, in abstract harmonic analysis, total variation de-noising, and multi-scale edge denoising. Basis Pursuit in highly overcomplete dictionaries leads to large-scale optimization problems. With signals of length 8192 and a wavelet packet dictionary, one gets an equivalent linear program of size 8192 by 212,992. Such problems can be attacked successfully only because of recent advances in linear programming by interior-point methods. We obtain reasonable success with a primal-dual logarithmic barrier method and conjugate-gradient solver.

Keyphrases

atomic decomposition basis pursuit    basis pursuit    linear programming    large-scale optimization problem    multi-scale edge denoising    large number    abstract harmonic analysis    primal-dual logarithmic barrier method    ill-posed problem    wavelet packet dictionary    dictionary element    special dictionary    several advantage    best orthogonal basis    overcomplete dictionary    interesting relation    conjugate-gradient solver    overcomplete system    reasonable success    overcomplete waveform dictionary stationary wavelet    recent advance    time-scale community    interior-point method    cosine packet    wavelet packet    total variation de-noising    equivalent linear program    several method    optimal superposition   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University