Weighted universal bit allocation: optimal multiple quantization matrix coding
- Creators
- Effros, M.
- Chou, P. A.
Abstract
We introduce a two-stage bit allocation algorithm analogous to the algorithm for weighted universal vector quantization (WUVQ). The encoder uses a collection of possible bit allocations (typically in the form of a collection of quantization matrices) rather than a single bit allocation (or single quantization matrix). We describe both an encoding algorithm for achieving optimal compression using a collection of bit allocations and a technique for designing locally optimal collections of bit allocations. We demonstrate performance on a JPEG style coder using the mean squared error (MSE) distortion measure. On a sequence of medical brain scans, the algorithm achieves up to 2.5 dB improvement over a single bit allocation system, up to 5 dB improvement over a WUVQ with first- and second-stage vector dimensions equal to 16 and 4 respectively, and up to 12 dB improvement over an entropy constrained vector quantizer (ECVQ) using 4 dimensional vectors.
Additional Information
© Copyright 1995 IEEE. Reprinted with permission. This material is based upon work partially supported by an AT&T Graduate Scholarship and by a grant from the Center for Telecommunications at Stanford.Files
Name | Size | Download all |
---|---|---|
md5:e545f3764e85fcbc2c6523290ee4aa30
|
362.5 kB | Preview Download |
Additional details
- Eprint ID
- 7337
- Resolver ID
- CaltechAUTHORS:EFFicassp95
- Created
-
2007-02-01Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field