loading...
Multi-resolution Source Coding Using Entropy Constrained Dithered Scalar Quantization
Snowbird, Utah March 23-March 25
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2004.1281447Data Compression Conference (DCC '04)
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Qian Zhao, Oracle Corp., Redwood City, CA
Hanying Feng, Stanford University, CA
Michelle Effros, California Institute of Technology, Pasadena, CA
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.
Citation:
Qian Zhao, Hanying Feng, Michelle Effros, "Multi-resolution Source Coding Using Entropy Constrained Dithered Scalar Quantization," dcc, pp.22, Data Compression Conference (DCC '04), 2004
Usage of this product signifies your acceptance of the Terms of Use.