Fast compressive imaging using scrambled block Hadamard ensemble

With the advent of a single-pixel camera, compressive imaging applications have gained wide interests. However, the design of efficient measurement basis in such a system remains as a challenging problem. In this paper, we propose a highly sparse and fast sampling operator based on the scrambled block Hadamard ensemble. Despite its simplicity, the proposed measurement operator offers universality and requires a near-optimal number of samples for perfect reconstruction. Moreover, it can be easily implemented in the optical domain thanks to its integer-valued elements. Several numerical experiments show that its imaging performance is comparable to that of the dense, floating-coefficient scrambled Fourier ensemble at much lower implementation cost.

[1]  Justin Romberg,et al.  Practical Signal Recovery from Random Projections , 2005 .

[2]  S. Chatterjee Stein’s method for concentration inequalities , 2006, math/0604352.

[3]  Emmanuel J. Candès,et al.  Robust Signal Recovery from Incomplete Observations , 2006, 2006 International Conference on Image Processing.

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

[5]  M. Lustig,et al.  Compressed Sensing MRI , 2008, IEEE Signal Processing Magazine.

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

[7]  E. Candès,et al.  Sparsity and incoherence in compressive sampling , 2006, math/0611957.

[8]  Markus G. Kuhn,et al.  Analysis of the Nagravision Video Scrambling Method , 1998 .

[9]  Bernard Chazelle,et al.  Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform , 2006, STOC '06.

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

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

[12]  Mário A. T. Figueiredo,et al.  Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems , 2007, IEEE Journal of Selected Topics in Signal Processing.

[13]  E. Candès,et al.  Inverse Problems Sparsity and incoherence in compressive sampling , 2007 .

[14]  Piotr Indyk,et al.  Sparse Recovery Using Sparse Random Matrices , 2010, LATIN.

[15]  Joel A. Tropp,et al.  Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.

[16]  W. Hoeffding A Combinatorial Central Limit Theorem , 1951 .

[17]  Ting Sun,et al.  Single-pixel imaging via compressive sampling , 2008, IEEE Signal Process. Mag..