Bayesian Compressive Sensing of Images Based on Effective Blocking

The traditional reconstruction method of Compressive Sensing (CS) was mostly depended on L1-norm linear regression model. And here we propose Bayesian Compressive Sensing (BCS) to reconstruct the signal. It provides posterior distribution of the parameter rather than point estimate, so we can get the uncertainty of the estimation to optimize the data reconstruction process adaptively. In this paper, we employ hierarchical form of Laplace prior, and aiming at improving the efficiency of reconstruction, we segment image into blocks, employ various sample rates to compress different kinds of block and utilize relevance vector machine (RVM) to sparse signal in the reconstruction process. At last, we provide experimental result of image, and compare with the state-of-the-art CS algorithms, it demonstrating the superior performance of the proposed approach.

[1]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[2]  Richard G. Baraniuk,et al.  Bayesian Compressive Sensing Via Belief Propagation , 2008, IEEE Transactions on Signal Processing.

[3]  Christian Jutten,et al.  An Iterative Bayesian Algorithm for Sparse Component Analysis in Presence of Noise , 2009, IEEE Transactions on Signal Processing.

[4]  Lawrence Carin,et al.  Bayesian Compressive Sensing , 2008, IEEE Transactions on Signal Processing.

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

[6]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[7]  Aggelos K. Katsaggelos,et al.  Bayesian Compressive Sensing Using Laplace Priors , 2010, IEEE Transactions on Image Processing.