Statistical prior based low complexity recovery for compressed image sensing

In this paper, a low complexity yet high performance recovery method coupling with the separable image sensing encoder is proposed, by exploring the statistical prior of image representations in the wavelet domain. Specifically, the energy distribution of natural images in the wavelet domain is investigated and found to be well characterized by an exponential decay model, which is then used as statistical priori information during the recovery algorithm design. The recovery process is composed of two steps, where the row-wise (or column-wise) intermediates and column-wise (or row-wise) final results are reconstructed sequentially. During each step of the recovery, the reconstruction is constrained to conform with the statistical prior by introducing a weight matrix. Two recovery strategies with different levels of complexity are designed, named the one-time direct recovery (OTD) and the two-times iterative recovery (TTI). The OTD strategy focuses on extremely fast recovery speed, with same weight matrixes for the two steps. While for the TTI strategy, the weight matrix for the second step will be iteratively refined, aiming to achieve more accurate recovery results. Extensive simulations have been conducted, and results show that the proposed recovery method with OTD strategy can achieve much faster recovery speed than traditional methods, and at the same time, the recovery quality is better; recovery with TTI strategy can achieve the best recovery quality at the expense of slight degradation in recovery speed, yet still faster than the traditional methods.

[1]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[2]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[3]  Mike E. Davies,et al.  Gradient Pursuits , 2008, IEEE Transactions on Signal Processing.

[4]  Yan Lin,et al.  Separate-combine recovery for compressed sensing of large images , 2014, 2014 IEEE International Conference on Communications (ICC).

[5]  Volkan Cevher,et al.  Learning with Compressible Priors , 2009, NIPS.

[6]  G. Carrijo,et al.  Quantization Noise on Image Reconstruction Using Model-Based Compressive Sensing , 2015, IEEE Latin America Transactions.

[7]  Adrian Stern,et al.  Compressed Imaging With a Separable Sensing Operator , 2009, IEEE Signal Processing Letters.

[8]  D. Donoho,et al.  Sparse MRI: The application of compressed sensing for rapid MR imaging , 2007, Magnetic resonance in medicine.

[9]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[10]  I. Daubechies,et al.  An iterative thresholding algorithm for linear inverse problems with a sparsity constraint , 2003, math/0307152.

[11]  Michael Elad,et al.  Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Toshiyuki Tanaka,et al.  A User's Guide to Compressed Sensing for Communications Systems , 2013, IEICE Trans. Commun..

[13]  Yong Fang,et al.  2D sparse signal recovery via 2D orthogonal matching pursuit , 2012, Science China Information Sciences.