Bayesian Compressive Sensing via Belief Propagation

Details Bayesian Compressive Sensing via Belief Propagation Bayesian Compressive Sensing via Belief Propagation

2008-12-25

arxiv.org/abs/0812.4627v2

Computer Science

Information Theory

25 pages with 8 figures; to appear in IEEE Transactions on Signal Processing

Scientific paper

Compressive sensing (CS) is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable, sub-Nyquist signal acquisition. When a statistical characterization of the signal is available, Bayesian inference can complement conventional CS methods based on linear programming or greedy algorithms. We perform approximate Bayesian inference using belief propagation (BP) decoding, which represents the CS encoding matrix as a graphical model. Fast computation is obtained by reducing the size of the graphical model with sparse encoding matrices. To decode a length-N signal containing K large coefficients, our CS-BP decoding algorithm uses O(Klog(N)) measurements and O(Nlog^2(N)) computation. Finally, although we focus on a two-state mixture Gaussian model, CS-BP is easily adapted to other signal models.

Affiliated with

Also associated with

No associations

Rating

Bayesian Compressive Sensing via Belief Propagation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bayesian Compressive Sensing via Belief Propagation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bayesian Compressive Sensing via Belief Propagation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-295069