Compressed sensing of color images

Authors:
Angshul Majumdar;Rabab K. Ward
Affiliations:
Kaiser 2010, 2332 Main Mall, Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC, Canada V6T 1Z4;Kaiser 2010, 2332 Main Mall, Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC, Canada V6T 1Z4
Venue:
Signal Processing
Year:
2010

Citing 5
Cited 1

Compressive imaging of color images

ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
A fast approach for overcomplete sparse decomposition based on smoothed l0 norm

IEEE Transactions on Signal Processing
Robust recovery of signals from a structured union of subspaces

IEEE Transactions on Information Theory
Compressed sensing

IEEE Transactions on Information Theory
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

IEEE Transactions on Information Theory

Sparse representation and learning in visual recognition: Theory and applications

Signal Processing

Quantified Score

Hi-index	0.08

Visualization

Abstract

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 1dB PSNR) over ordinary sparse algorithm.