Compressive Sensing (CS) is known as a new sampling theory that use small number of basis elements for constructing of signals (or images) and these basis elements (so called sparsity number) are very important parameters that approximate how sparsify the image is. Due to several characteristics of each image groups, the sparsity number could be varied and there is unfortunately very little research for this issue. This paper presents two main contributions: First, this paper proposes a practical sparsity number estimation technique using for an image reconstruction for SL0 algorithm based on Discrete Cosine Transform domain (DCT). Second the practical sparsity number of difference image groups is the experiment based on over 2000 images. The DCT is exclusively applied for a sparse representation of images because it is proven as a useful instrument for image analysis and processing. In general, images can be represented by a linear superposition of small number of wavelet elements selected from a suitable filter. The proposed models process the image with Smoothed norm algorithm. This algorithm stated that if signal or image is sufficiently sparse, we can reconstruct it from small amount of none zero basis components. The experiment is comprehensively tested under 2000 sampling images that are categorized in 18 groups by their characteristics. Moreover this sparsity number is practically used for any CS algorithm based on DCT domain.
[1]
Terence Tao,et al.
The Dantzig selector: Statistical estimation when P is much larger than n
,
2005,
math/0506081.
[2]
Sarah J Parsons,et al.
Guest Editors
,
2012,
Oncogene.
[3]
Martin Vetterli,et al.
Compressive Sampling [From the Guest Editors]
,
2008,
IEEE Signal Processing Magazine.
[4]
Sudipto Guha,et al.
Near-optimal sparse fourier representations via sampling
,
2002,
STOC '02.
[5]
JuttenChristian,et al.
A fast approach for overcomplete sparse decomposition based on smoothed l0 norm
,
2009
.
[6]
Rémi Gribonval,et al.
Sparse representations in unions of bases
,
2003,
IEEE Trans. Inf. Theory.
[7]
Martin Vetterli,et al.
Data Compression and Harmonic Analysis
,
1998,
IEEE Trans. Inf. Theory.
[8]
E. Candès,et al.
Stable signal recovery from incomplete and inaccurate measurements
,
2005,
math/0503066.
[9]
D. Donoho.
Unconditional Bases and Bit-Level Compression
,
1996
.
[10]
David J. Kriegman,et al.
The yale face database
,
1997
.
[11]
Christian Jutten,et al.
A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
,
2008,
IEEE Transactions on Signal Processing.