• DocumentCode
    3587978
  • Title

    Bootstrapped sparse Bayesian learning for sparse signal recovery

  • Author

    Giri, Ritwik ; Rao, Bhaskar D.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of California, San Diego, La Jolla, CA, USA
  • fYear
    2014
  • Firstpage
    1657
  • Lastpage
    1661
  • Abstract
    In this article we study the sparse signal recovery problem in a Bayesian framework using a novel Bootstrapped Sparse Bayesian Learning method. Sparse Bayesian Learning (SBL) framework is an effective tool for pruning out the irrelevant features and ending up with a sparse representation. In SBL the choice of prior over the variances of the Gaussian Scale mixture has been an interesting area of research for some time now. This motivates us to use a more generalized maximum entropy density as the prior which results in a new variant of SBL. It has been shown to perform better than traditional SBL empirically and it also accelerates the pruning procedure. Because of this advantage, this variant of SBL can be claimed as more robust choice as it is less sensitive to the threshold for pruning. Theoretical justifications have also been provided to show that the proposed model actually promotes sparse point estimates.
  • Keywords
    Bayes methods; Gaussian processes; entropy; estimation theory; learning (artificial intelligence); signal processing; Gaussian scale mixture; SBL; bootstrapped sparse Bayesian learning; generalized maximum entropy density; pruning procedure; sparse point estimation; sparse representation; sparse signal recovery; Bayes methods; Cost function; Dictionaries; Entropy; Estimation; Minimization; Noise measurement; Bootstrapped; Expectation-Maximization; Max-Entropy; Sparse Bayesian Learning;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers, 2014 48th Asilomar Conference on
  • Print_ISBN
    978-1-4799-8295-0
  • Type

    conf

  • DOI
    10.1109/ACSSC.2014.7094748
  • Filename
    7094748