loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Compression Conference (DCC '95)
Quantization of overcomplete expansions
Snowbird, Utah
March 28-March 30
ISBN: 0-8186-7012-6
V.K. Goyal, Dept. of Electr. Eng., California Univ., Berkeley, CA, USA
M. Vetterli, Dept. of Electr. Eng., California Univ., Berkeley, CA, USA
N.T. Thao, Dept. of Electr. Eng., California Univ., Berkeley, CA, USA
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.
Index Terms:
data compression; signal representation; quantisation (signal); overcomplete expansions; overcomplete sets; redundant bases; vectors; frames; quantization; signal compression; signal statistics adaptation; fixed quantization; greedy quantization; matching pursuit; MSE slope; frame redundancy; signal representation; tight frame; dictionary
Citation:
V.K. Goyal, M. Vetterli, N.T. Thao, "Quantization of overcomplete expansions," dcc, pp.13, Data Compression Conference (DCC '95), 1995
Usage of this product signifies your acceptance of the Terms of Use.