Zhao, Qian and Feng, Hanying and Effros, Michelle (2004) Multiresolution source coding using entropy constrained dithered scalar quantization. In: Data Compression Conference (DCC '04), Snowbird, UT, 23-25 March 2004. IEEE , Los Alamitos, CA, pp. 22-31. ISBN 0769520820. https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc04
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
See Usage Policy. 345kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc04
Abstract
In this paper, we build multiresolution 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 multiresolution 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.
| Item Type: | Book Section | ||||||
|---|---|---|---|---|---|---|---|
| Related URLs: |
| ||||||
| Additional Information: | © Copyright 2004 IEEE. Reprinted with permission. | ||||||
| Subject Keywords: | entropy codes; image coding; source coding; n-dimensional random vector; set partitioning in hierarchical tree algorithm; source coding theory; network information theory | ||||||
| Record Number: | CaltechAUTHORS:ZHAdcc04 | ||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc04 | ||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||||
| ID Code: | 4759 | ||||||
| Collection: | CaltechAUTHORS | ||||||
| Deposited By: | Archive Administrator | ||||||
| Deposited On: | 06 Sep 2006 | ||||||
| Last Modified: | 02 Oct 2019 23:16 |
Repository Staff Only: item control page
