Skip to main content
Article thumbnail
Location of Repository

Fast Bayesian compressive sensing using Laplace priors

By S. Derin Babacan, Rafael Molina and Aggelos K. Katsaggelos

Abstract

In this paper we model the components of the compressive sensing (CS) problem using the Bayesian framework by utilizing a hierarchical form of the Laplace prior to model sparsity of the unknown signal. This signal prior includes some of the existing models as special cases and achieves a high degree of sparsity. We develop a constructive (greedy) algorithm resulting from this formulation where necessary parameters are estimated solely from the observation and therefore no user-intervention is needed. We provide experimental results with synthetic 1D signals and images, and compare with the state-of-the-art CS reconstruction algorithms demonstrating the superior performance of the proposed approach. Index Terms — Bayesian methods, compressive sensing, inverse problems, sparse Bayesian learning, relevance vector machin

Topics: RVM
Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.161.8104
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://ivpl.eecs.northwestern.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.