Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published 1998 | public
Book Section - Chapter Open

Practical multi-resolution source coding: TSVQ revisited

Abstract

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.

Additional Information

© Copyright 1998 IEEE. Reprinted with permission. This material is based upon work partially supported by NSF Grant No. MIP-9501977.

Files

EFFdcc98.pdf
Files (238.9 kB)
Name Size Download all
md5:ec85ef1beb32f18c2ab2d72291c60963
238.9 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023