A plurality of sparse representations is better than the sparsest one alone

Michael Elad, Irad YavnehIEEE Trans. Information Theory 2009 · DOI · OpenReview

Abstract

para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> Cleaning of noise from signals is a classical and long-studied problem in signal processing. Algorithms for this task necessarily rely on an <emphasis emphasistype="boldital">a priori</emphasis> knowledge about the signal characteristics, along with information about the noise properties. For signals that admit sparse representations over a known dictionary, a commonly used denoising technique is to seek the sparsest representation that synthesizes a signal close enough to the corrupted one. As this problem is too complex in general, approximation methods, such as greedy pursuit algorithms, are often employed. </para>
BibTeX
@article{elad2009plurality,
  author = {Michael Elad and Irad Yavneh},
  title = {{A plurality of sparse representations is better than the sparsest one alone}},
  journal = {IEEE Trans. Information Theory},
  year = {2009},
  doi = {10.1109/tit.2009.2027565},
}

Loading related content...

Figure