Abstract
A novel optimal adaptive scalar quantization method is proposed, and its performance is investigated in the context of quantization for image compression. The idea is to perform frequent and complete (non-incremental) block-optimal quantizer redesign, but under a codebook constraint which assures that the overhead required to specify the new quantizer is small. The intuition is that a few levels are usually sufficient to accurately describe a small image block, provided these are chosen optimally and independently for each block. In addition to limiting overhead, the codebook constraint can be exploited to derive an efficient dynamic programming algorithm for block-optimal quantizer design. Some experimental results and comparisons are also included.
| Original language | English (US) |
|---|---|
| Pages | 574-577 |
| Number of pages | 4 |
| State | Published - 1998 |
| Externally published | Yes |
| Event | Proceedings of the 1998 International Conference on Image Processing, ICIP. Part 2 (of 3) - Chicago, IL, USA Duration: Oct 4 1998 → Oct 7 1998 |
Other
| Other | Proceedings of the 1998 International Conference on Image Processing, ICIP. Part 2 (of 3) |
|---|---|
| City | Chicago, IL, USA |
| Period | 10/4/98 → 10/7/98 |