Multi-resolution Source Coding Using Entropy Constrained Dithered Scalar Quantization

In this paper, we build multi-resolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for n-dimensional random vectors, dithering followed by uniform scalar quantization and then by entropy coding achieves performance close to the n-dimensional optimum for a multi-resolution source code. Based on this result, we propose a practical code design algorithm and compare its performance with that of the Set Partitioning in Hierarchical Trees (SPIHT) algorithm on natural images.

• Type: Conference
• Year: 2004
• Where: DCC
• Authors: Qian Zhao, Hanying Feng, Michelle Effros
• Keywords: Computer Graphics, DCC 2004, Multi-resolution Source Code, Multi-resolution Source Codes, N-dimensional Random Vectors