Compressed sensing of color images. (English) Zbl 1197.94089

Summary: This work proposes a method for color imaging via compressive sampling. Random projections from each of the color channels are acquired separately. The problem is to reconstruct the original color image from the randomly projected (sub-sampled) data. Since each of the color channels are sparse in some domain (DCT, Wavelet, etc.) one way to approach the reconstruction problem is to apply sparse optimization algorithms. We note that the color channels are highly correlated and propose an alternative reconstruction method based on group sparse optimization. Two new non-convex group sparse optimization methods are proposed in this work. Experimental results show that incorporating group sparsity into the reconstruction problem produces significant improvement (more than 1 dB PSNR) over ordinary sparse algorithm.


94A12 Signal theory (characterization, reconstruction, filtering, etc.)
Full Text: DOI


[1] Wakin, M.; Laska, J.; Duarte, M.; Baron, D.; Sarvotham, S.; Takhar, D.; Kelly, K.; Baraniuk, R.: An architecture for compressive imaging, IEEE int. Conf. image process., 1273-1276 (2006)
[2] Donoho, D.: For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution, Comm. pure appl. Math. 59, No. 6, 797-829 (2006) · Zbl 1113.15004
[3] Chartrand, R.; Yin, W.: Iteratively reweighted algorithms for compressive sensing, IEEE int. Conf. acoust., speech signal process., 3869-3872 (2008)
[4] R. Saab, Ö Yilmaz, Sparse recovery by non-convex optimization–instance optimality, arXiv:0809.0745v1 [cs.IT]. · Zbl 1200.90158
[5] Donoho, D. L.: Compressed sensing, IEEE trans. Inf. theory 52, No. 4, 1289-1306 (2006) · Zbl 1288.94016
[6] Cand‘es, E. J.; Tao, T.: Near optimal signal recovery from random projections: universal encoding strategies?, IEEE trans. Inf. theory 52, No. 12, 5406-5425 (2006) · Zbl 1309.94033
[7] Nagesh, P.; Li, B.: Compressive imaging of color images, IEEE int. Conf. acoust., speech signal process. (2009)
[8] Y.C. Eldar, M. Mishali, Robust recovery of signals from a union of subspaces, IEEE Trans. Inf. Theory 53(11) (2009) 5302–5316 · Zbl 1367.94087
[9] J. Huang, T. Zhang, The benefit of group sparsity, arXiv:0901.2962v1. · Zbl 1202.62052
[10] M. Stojnic, F. Parvaresh, B. Hassibi, On the reconstruction of block-sparse signals with an optimal number of measurements, arXiv:0804.0041v1. · Zbl 1391.94402
[11] Kim, Y.; Kim, J.; Kim, Y.: Blockwise sparse regression, Stat. sin. 16, 375-390 (2006) · Zbl 1096.62076
[12] Meier, L.; Van De Geer, S.; Buhlmann, P.: The group lasso for logistic regression, J. R. Stat. soc. B 70, 53-71 (2008) · Zbl 1400.62276
[13] Turlach, B.; Venables, W.; Wright, S.: Simultaneous variable selection, Technometrics 47, 349-363 (2005)
[14] Yuan, M.; Lin, Y.: Model selection and estimation in regression with grouped variables, J. R. Stat. soc. B 68, 49-67 (2006) · Zbl 1141.62030
[15] I. Daubechies, R. DeVore, M. Fornasier, C. Sinan Güntürk, Iteratively re-weighted least squares minimization for sparse recovery, preprint, 2008.
[16] Mohimani, H.; Babaie-Zadeh, M.; Jutten, C.: A fast approach for overcomplete sparse decomposition based on smoothed \(\ell (0)\) norm, IEEE trans. Signal process. 57, No. 1, 289-301 (2008) · Zbl 1173.94376
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.