L1-minimization algorithm for Bayesian online compressed sensing

Citations of this article
Mendeley users who have this article in their library.


© 2017 by the authors. In this work, we propose a Bayesian online reconstruction algorithm for sparse signals based on Compressed Sensing and inspired by L1-regularization schemes. A previous work has introduced a mean-field approximation for the Bayesian online algorithm and has shown that it is possible to saturate the offline performance in the presence of Gaussian measurement noise when the signal generating distribution is known. Here, we build on these results and show that reconstruction is possible even if prior knowledge about the generation of the signal is limited, by introduction of a Laplace prior and of an extra Kullback-Leibler divergence minimization step for hyper-parameter learning.




Rossi, P. V., & Vicente, R. (2017). L1-minimization algorithm for Bayesian online compressed sensing. Entropy, 19(12). https://doi.org/10.3390/e19120667

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free