Abstract
We propose a new algorithm for image compression based on compressive sensing (CS). The algorithm starts with a traditional multilevel 2-D Wavelet decomposition, which provides a compact representation of image pixels. We then introduce a new approach for rearranging the wavelet coefficients into a structured manner to formulate sparse vectors. We use a Gaussian random measurement matrix normalized with the weighted average Root Mean Squared energies of different wavelet subbands. Compressed sampling is finally performed using this normalized measurement matrix. At the decoding end, the image is reconstructed using a simple ℓ1-minimization technique. The proposed wavelet-based CS reconstruction, with the normalized measurement matrix, results in performance increase compared to other conventional CS-based techniques. The proposed approach introduces a completely new framework for using CS in the wavelet domain. The technique was tested on different natural images. We show that the proposed technique outperforms most existing CS-based compression methods.
| Original language | English |
|---|---|
| Pages (from-to) | 6737-6754 |
| Number of pages | 18 |
| Journal | Multimedia Tools and Applications |
| Volume | 75 |
| Issue number | 12 |
| DOIs | |
| State | Published - 1 Jun 2016 |
Bibliographical note
Publisher Copyright:© 2015, Springer Science+Business Media New York.
Keywords
- Adaptive sampling
- Compressed sensing
- Discrete wavelet transform
- Image compression
- Image quality
- Sparse representation
ASJC Scopus subject areas
- Software
- Media Technology
- Hardware and Architecture
- Computer Networks and Communications