Message Passing Algorithms for Compressed Sensing: II. Analysis and Validation

Details Message Passing Algorithms for Compressed Sensing: II. Analysis and Validation Message Passing Algorithms for Compressed Sensing: II. Analysis and Validation

2009-11-22

arxiv.org/abs/0911.4222v1

Computer Science

Information Theory

5 pages, 3 pdf figures, IEEE Information Theory Workshop, Cairo 2010

Scientific paper

In a recent paper, the authors proposed a new class of low-complexity iterative thresholding algorithms for reconstructing sparse signals from a small set of linear measurements \cite{DMM}. The new algorithms are broadly referred to as AMP, for approximate message passing. This is the second of two conference papers describing the derivation of these algorithms, connection with related literature, extensions of original framework, and new empirical evidence. This paper describes the state evolution formalism for analyzing these algorithms, and some of the conclusions that can be drawn from this formalism. We carried out extensive numerical simulations to confirm these predictions. We present here a few representative results.

Affiliated with

Also associated with

No associations

Rating

Message Passing Algorithms for Compressed Sensing: II. Analysis and Validation 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 Message Passing Algorithms for Compressed Sensing: II. Analysis and Validation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Message Passing Algorithms for Compressed Sensing: II. Analysis and Validation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-417941