Quantization of Overcomplete Expansions

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 exibility like adaptation to signal statistics. We show results using both xed 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 veried experimentally for another frame.

• Type: Conference
• Year: 1995
• Where: DCC
• Authors: Vivek K. Goyal, Martin Vetterli, Nguyen T. Thao
• Keywords: Computer Graphics, DCC 1995, Particular Tight Frame, Redundant Bases, Transform Coding