DocumentCode :
2398079
Title :
Quantization of overcomplete expansions
Author :
Goyal, Vivek K. ; Vetterli, Martin ; Thao, Nguyen T.
Author_Institution :
Dept. of Electr. Eng., California Univ., Berkeley, CA, USA
fYear :
1995
fDate :
28-30 Mar 1995
Firstpage :
13
Lastpage :
22
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 :
data compression; quantisation (signal); signal representation; MSE slope; dictionary; fixed quantization; frame redundancy; frames; greedy quantization; matching pursuit; overcomplete expansions; overcomplete sets; quantization; redundant bases; signal compression; signal representation; signal statistics adaptation; tight frame; vectors; Dictionaries; Discrete cosine transforms; Discrete transforms; Image coding; Karhunen-Loeve transforms; Matching pursuit algorithms; Rate-distortion; Statistics; Transform coding; Vector quantization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Compression Conference, 1995. DCC '95. Proceedings
Conference_Location :
Snowbird, UT
ISSN :
1068-0314
Print_ISBN :
0-8186-7012-6
Type :
conf
DOI :
10.1109/DCC.1995.515491
Filename :
515491
Link To Document :
بازگشت