Efficient High-Dimensional Inference in the Multiple Measurement Vector Problem

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

26 pages, 9 figures

Scientific paper

In this work, a Bayesian approximate message passing algorithm is proposed for solving the multiple measurement vector (MMV) problem in compressive sensing, in which a collection of sparse signal vectors that share a common support are recovered from undersampled noisy measurements. The algorithm, AMP-MMV, is capable of exploiting temporal correlations in the amplitudes of non-zero coefficients, and provides soft estimates of the signal vectors as well as the underlying support. Central to the proposed approach is an extension of recently developed approximate message passing techniques to the amplitude-correlated MMV setting. Aided by these techniques, AMP-MMV offers a computational complexity that is linear in all problem dimensions. In order to allow for automatic parameter tuning, an expectation-maximization algorithm that complements AMP-MMV is described. Finally, a detailed numerical study demonstrates the power of the proposed approach and its particular suitability for application to high-dimensional problems.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Efficient High-Dimensional Inference in the Multiple Measurement Vector Problem 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 Efficient High-Dimensional Inference in the Multiple Measurement Vector Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient High-Dimensional Inference in the Multiple Measurement Vector Problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-553922

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.