Compressive Imaging using Approximate Message Passing and a Markov-Tree Prior

Details Compressive Imaging using Approximate Message Passing and a Markov-Tree Prior Compressive Imaging using Approximate Message Passing and a Markov-Tree Prior

2011-08-12

arxiv.org/abs/1108.2632v1

Computer Science

Computer Vision and Pattern Recognition

Scientific paper

We propose a novel algorithm for compressive imaging that exploits both the sparsity and persistence across scales found in the 2D wavelet transform coefficients of natural images. Like other recent works, we model wavelet structure using a hidden Markov tree (HMT) but, unlike other works, ours is based on loopy belief propagation (LBP). For LBP, we adopt a recently proposed "turbo" message passing schedule that alternates between exploitation of HMT structure and exploitation of compressive-measurement structure. For the latter, we leverage Donoho, Maleki, and Montanari's recently proposed approximate message passing (AMP) algorithm. Experiments with a large image database suggest that, relative to existing schemes, our turbo LBP approach yields state-of-the-art reconstruction performance with substantial reduction in complexity.

Affiliated with

Also associated with

No associations

Rating

Compressive Imaging using Approximate Message Passing and a Markov-Tree Prior 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 Compressive Imaging using Approximate Message Passing and a Markov-Tree Prior, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressive Imaging using Approximate Message Passing and a Markov-Tree Prior will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-16441