A novel variation-based block compressed sensing restoration method

In order to improve the performance of the current restoration method for block compressed sensing under the low complexity, we propose a novel variation-based block compressed sensing restoration method. The method decomposes the image into several non-overlapping blocks first, followed by the scanning according to the column and measurement by blocks, respectively, so as to obtain several column vectors of measurement value. The decoding end integrated the column vectors of measurement value received into matrixes, making the sparsity of image regular terms as the prior knowledge and minimizing the augmented Lagrange function as the goal. In this way, the sub-problems can be orderly solved with the variant alternating direction multiplier method, while the column vector space of image blocks was reconstructed. Finally, an anti-scanning was performed before it was combined into images. The innovation point is to apply the total variation model into the restoration framework for block compressed sensing with a small amount of calculation cost, and to extent it to a mixed variation model which can contain multiple regular terms and generality. Contrast to the current restoration algorithm relating to block compressed sensing, the simulation results show that the proposed method can achieve a better SSIM and the fastest restoration speed, while the SSIM and PSNR of the proposed method can achieve the best result.

[1]  Michael B. Wakin,et al.  The Restricted Isometry Property for Random Block Diagonal Matrices , 2012, ArXiv.

[2]  Yin Zhang,et al.  Compressive sensing for 3d data processing tasks: applications, models and algorithms , 2011 .

[3]  James E. Fowler,et al.  Block Compressed Sensing of Images Using Directional Transforms , 2010, 2010 Data Compression Conference.

[4]  James E. Fowler,et al.  Block-Based Compressed Sensing of Images and Video , 2012, Found. Trends Signal Process..

[5]  Xiaoming Yuan,et al.  A splitting method for separable convex programming , 2015 .

[6]  Bingsheng He,et al.  Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems : a uniform approach , 2011 .

[7]  Chengbo Li An efficient algorithm for total variation regularization with applications to the single pixel camera and compressive sensing , 2010 .

[8]  Trac D. Tran,et al.  Fast and Efficient Compressive Sensing Using Structurally Random Matrices , 2011, IEEE Transactions on Signal Processing.

[9]  慧 廣瀬 A Mathematical Introduction to Compressive Sensing , 2015 .

[10]  Gitta Kutyniok,et al.  1 . 2 Sparsity : A Reasonable Assumption ? , 2012 .

[11]  Trac D. Tran,et al.  Fast compressive sampling with structurally random matrices , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

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

[13]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[14]  Bingsheng He,et al.  Proximal-like contraction methods for monotone variational inequalities in a unified framework I: Effective quadruplet and primary methods , 2012, Comput. Optim. Appl..

[15]  Khanh Quoc Dinh,et al.  Edge-preserving block compressive sensing with projected landweber , 2013, 2013 20th International Conference on Systems, Signals and Image Processing (IWSSIP).

[16]  Lu Gan Block Compressed Sensing of Natural Images , 2007, 2007 15th International Conference on Digital Signal Processing.

[17]  Bingsheng He,et al.  Proximal-like contraction methods for monotone variational inequalities in a unified framework II: general methods and numerical experiments , 2012, Comput. Optim. Appl..