The Analysis of Reconstruction Efficiency with Compressive Sensing in Different K-Spaces

Compressive sensing is a potential technology for lossy image compression. With a given quality, we may represent an image with a few significant coefficients in the sparse domain. According to the sparse modeling theories, we may randomly sense a few number of measurements in a transform domain and later reconstruct the sparse representation. Typically the sensing domain is a low-complexity transform domain and the computation complexity lies on the reconstruction phase. In this paper, the linear and nonlinear compressive sensing approaches are briefly introduced. A few experiments are performed based on the nonlinear approach. Both 2D-DFT and 2D-DCT sensing domains are included to show their effects to the reconstruction quality. The simulation shows that the two domains produce comparable results if the proper comparison condition is considered. Some directions of revising the reconstruction process is also discussed in this paper.

[1]  Arian Maleki,et al.  Coherence analysis of iterative thresholding algorithms , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[2]  Mike E. Davies,et al.  Iterative Hard Thresholding for Compressed Sensing , 2008, ArXiv.

[3]  Hsiang-Cheh Huang,et al.  Comparison on Different Random Basis Generator of a Single-Pixel Camera , 2013, 2013 Second International Conference on Robot, Vision and Signal Processing.

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

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

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