Compressed sensing reconstruction using Expectation Propagation
arXiv:1904.05777 · doi:10.1088/1751-8121/ab3065
Abstract
Many interesting problems in fields ranging from telecommunications to computational biology can be formalized in terms of large underdetermined systems of linear equations with additional constraints or regularizers. One of the most studied ones, the Compressed Sensing problem (CS), consists in finding the solution with the smallest number of non-zero components of a given system of linear equations for known measurement vector and sensing matrix . Here, we will address the compressed sensing problem within a Bayesian inference framework where the sparsity constraint is remapped into a singular prior distribution (called Spike-and-Slab or Bernoulli-Gauss). Solution to the problem is attempted through the computation of marginal distributions via Expectation Propagation (EP), an iterative computational scheme originally developed in Statistical Physics. We will show that this strategy is comparatively more accurate than the alternatives in solving instances of CS generated from statistically correlated measurement matrices. For computational strategies based on the Bayesian framework such as variants of Belief Propagation, this is to be expected, as they implicitly rely on the hypothesis of statistical independence among the entries of the sensing matrix. Perhaps surprisingly, the method outperforms uniformly also all the other state-of-the-art methods in our tests.
20 pages, 6 figures
References in corpus (3)
Cited by in corpus (4)
- Sparse Linear Spectral Unmixing of Hyperspectral images using Expectation-Propagation
- Relationship between fitness and heterogeneity in exponentially growing microbial populations
- Fast Scalable Image Restoration using Total Variation Priors and Expectation Propagation
- Expectation propagation on the diluted Bayesian classifier