Quantization of overcomplete expansions
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We present a method that represents a signal with respect to an overcomplete set of vectors which we call a dictionary. The use of overcomplete sets of vectors (redundant bases or frames) together with quantization is explored as an alternative to transform coding for signal compression. The goal is to retain the computational simplicity of transform coding while adding flexibility like adaptation to signal statistics. We show results using both fixed quantization in frames and greedy quantization using matching pursuit. An MSE slope of -6 dB/octave of frame redundancy is shown for a particular tight frame and is verified experimentally for another frame.Keywords
This publication has 6 references indexed in Scilit:
- Deterministic analysis of oversampled A/D conversion and decoding improvement based on consistent estimatesIEEE Transactions on Signal Processing, 1994
- Reduction of the MSE in R-times oversampled A/D conversion O(1/R) to O(1/R/sup 2/)IEEE Transactions on Signal Processing, 1994
- Matching pursuits with time-frequency dictionariesIEEE Transactions on Signal Processing, 1993
- Best wavelet packet bases in a rate-distortion senseIEEE Transactions on Image Processing, 1993
- Ten Lectures on WaveletsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1992
- Vector Quantization and Signal CompressionPublished by Springer Nature ,1992