Recovery from Linear Measurements with Complexity-Matching Universal Signal Estimation - implementation -

Dror just sent me the following:

Hello Igor,  

Here's a link with an improved implementation of our universal compressed sensing algorithm:http://people.engr.ncsu.edu/dzbaron/software/SLAM_ZhuBaronDuarte/ 

In recent work http://arxiv.org/abs/1204.2611
Junan, Marco, and I significantly improved our universal algorithm from 2011, often by 5 dB or more. The new algorithm is often competitive in terms of reconstruction quality with other Bayesian approaches *although* our algorithm does not know the input distribution.

Dror

--
Dror Baron, Ph.D.
Assistant Professor
Electrical and Computer Engineering Department
North Carolina State University
http://people.engr.ncsu.edu/dzbaron/

Thanks Dror !

Recovery from Linear Measurements with Complexity-Matching Universal Signal Estimation by Junan Zhu, Dror Baron, Marco F. Duarte

We study the compressed sensing (CS) signal estimation problem where an input signal is measured via a linear matrix multiplication under additive noise. While this setup usually assumes sparsity or compressibility in the input signal during recovery, the signal structure that can be leveraged is often not known a priori. In this paper, we consider universal CS recovery, where the statistics of a stationary ergodic signal source are estimated simultaneously with the signal itself. Inspired by Kolmogorov complexity and minimum description length, we focus on a maximum a posteriori (MAP) estimation framework that leverages universal priors to match the complexity of the source. Our framework can also be applied to general linear inverse problems where more measurements than in CS might be needed. We provide theoretical results that support the algorithmic feasibility of universal MAP estimation using a Markov chain Monte Carlo implementation, which is computationally challenging. We incorporate some techniques to accelerate the algorithm while providing comparable and in many cases better reconstruction quality than existing algorithms. Experimental results show the promise of universality in CS, particularly for low-complexity sources that do not exhibit standard sparsity or compressibility.

  Join the CompressiveSensing subreddit or the Google+ Community and post there !
Liked this entry ? subscribe to Nuit Blanche's feed, there's more where that came from. You can also subscribe to Nuit Blanche by Email, explore the Big Picture in Compressive Sensing or the Matrix Factorization Jungle and join the conversations on compressive sensing, advanced matrix factorization and calibration issues on Linkedin.