Effros, Michelle (1998) Practical multi-resolution source coding: TSVQ revisited. In: Data Compression Conference (DCC '98), Snowbird, UT, 30 March-1 April 1998. IEEE , Los Alamitos, CA, pp. 53-62. ISBN 0 8186 8406 2 http://resolver.caltech.edu/CaltechAUTHORS:EFFdcc98
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:EFFdcc98
Consider a multi-resolution source code for describing a stationary source at L resolutions. The description at the first resolution is given at rate R1 and achieves an expected distortion no greater than D1. The description at the second resolution includes both the first description and a refining description of rate R2 and achieves expected distortion no greater than D2, and so on. Previously derived multi-resolution source coding bounds describe the family of achievable rate and distortion vectors ((R1, R2, ..., RL ), (D1, D2, DL)). By examining these multi-resolution rate-distortion bounds, we gain insight into the problem of practical multi-resolution source coding. These insights lead to a new multi-resolution source code based on the tree-structured vector quantizer. This paper covers the algorithm, its optimal design, and preliminary experimental results.
|Item Type:||Book Section|
|Additional Information:||© Copyright 1998 IEEE. Reprinted with permission. This material is based upon work partially supported by NSF Grant No. MIP-9501977.|
|Subject Keywords:||data compression, rate distortion theory, signal resolution, source coding, trees (mathematics), vector quantization, source code design, source coding theory, network information theory|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Lindsay Cleary|
|Deposited On:||12 Feb 2007|
|Last Modified:||26 Dec 2012 09:31|
Repository Staff Only: item control page