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 transform domain. When the number of the significant coefficients is much less than the number of the pixels, the assumption of sparse representation is satisfied. Based on the sparse modeling theories, an image could be sensed with a relatively simple hardware and reconstructed with a powerful computer. We are interested in how to implement the iterative hard thresholding algorithm. The formula is not complex, but the implementation is not straightforward when the image resolution is high. Therefore, the computation complexity and the memory consumptions are analyzed. With the analysis result and the implementation experiences, we discuss the issues that should be considered carefully when implementing the algorithm 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]
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.
[3]
E.J. Candes,et al.
An Introduction To Compressive Sampling
,
2008,
IEEE Signal Processing Magazine.
[4]
Mike E. Davies,et al.
Iterative Hard Thresholding for Compressed Sensing
,
2008,
ArXiv.
[5]
Ting Sun,et al.
Single-pixel imaging via compressive sampling
,
2008,
IEEE Signal Process. Mag..