Data compression based on compressed sensing and wavelet transform
Authors:
- 1 July 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 8, 537-542
Abstract
The recovery can be achieved from the undersampling signal in compressed sensing theory relying on the sparsity and incoherent characteristics of the signal. A data compression algorithm is advanced in this article, based on compressed sensing and wavelet transform. Firstly the framework of the compressed sensing theory is introduced, and then a one-dimension and a two-dimension wavelet transform matrixes are constructed respectively, which leads two compressed algorithms based on modulus and original data separately. At last, the compression characteristics are simulated and compared using one-dimension signal and two-dimension images separately, at the same time, the validity is proved by those results.Keywords
This publication has 7 references indexed in Scilit:
- On the Role of Sparse and Redundant Representations in Image ProcessingProceedings of the IEEE, 2010
- Robust Face Recognition via Sparse RepresentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2008
- An Introduction To Compressive SamplingIEEE Signal Processing Magazine, 2008
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?IEEE Transactions on Information Theory, 2006
- Compressed sensingIEEE Transactions on Information Theory, 2006
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency informationIEEE Transactions on Information Theory, 2006
- Image denoising using scale mixtures of gaussians in the wavelet domainIEEE Transactions on Image Processing, 2003