• DocumentCode
    1369942
  • Title

    A Plurality of Sparse Representations Is Better Than the Sparsest One Alone

  • Author

    Elad, Michael ; Yavneh, Irad

  • Author_Institution
    Dept. of Comput. Sci., Technion - Israel Inst. of Technol., Technion, Israel
  • Volume
    55
  • Issue
    10
  • fYear
    2009
  • Firstpage
    4701
  • Lastpage
    4714
  • Abstract
    Cleaning of noise from signals is a classical and long-studied problem in signal processing. Algorithms for this task necessarily rely on an a priori 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. In this line of reasoning, we are led to believe that detection of the sparsest representation is key in the success of the denoising goal. Does this mean that other competitive and slightly inferior sparse representations are meaningless? Suppose we are served with a group of competing sparse representations, each claiming to explain the signal differently. Can those be fused somehow to lead to a better result? Surprisingly, the answer to this question is positive; merging these representations can form a more accurate (in the mean-squared-error (MSE) sense), yet dense, estimate of the original signal even when the latter is known to be sparse. In this paper, we demonstrate this behavior, propose a practical way to generate such a collection of representations by randomizing the Orthogonal Matching Pursuit (OMP) algorithm, and produce a clear analytical justification for the superiority of the associated Randomized OMP (RandOMP) algorithm. We show that while the maximum a posteriori probability (MAP) estimator aims to find and use the sparsest representation, the minimum mean- squared-error (MMSE) estimator leads to a fusion of representations to form its result. Thus, working with an appropriate mixture of candidate representations, we are surpassing the MAP and tending towards the MMSE estimate, and thereby getting a far more accurate estimation in terms of the expected lscr2 - -norm error.
  • Keywords
    iterative methods; least mean squares methods; maximum likelihood estimation; signal denoising; signal representation; MAP estimator; MMSE estimator; approximation methods; denoising technique; greedy pursuit algorithms; maximum a posteriori probability estimator; minimum mean-squared-error estimator; noise properties; orthogonal matching pursuit algorithm; signal processing; sparse representations; sparsest representation; Approximation methods; Cleaning; Dictionaries; Matching pursuit algorithms; Merging; Noise reduction; Pursuit algorithms; Signal processing; Signal processing algorithms; Signal synthesis; Bayesian; maximum a posteriori probability (MAP); minimum-mean-squared error (MMSE); sparse representations;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2009.2027565
  • Filename
    5238753