DocumentCode
3025811
Title
Practical multi-resolution source coding: TSVQ revisited
Author
Effros, Michelle
Author_Institution
California Inst. of Technol., Pasadena, CA, USA
fYear
1998
fDate
30 Mar-1 Apr 1998
Firstpage
53
Lastpage
62
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
Keywords
data compression; rate distortion theory; signal resolution; source coding; trees (mathematics); vector quantisation; TSVQ; achievable rate; data compression algorithm; distortion vectors; experimental results; multi-resolution rate-distortion bounds; multi-resolution source code; multi-resolution source coding; optimal design; stationary source; tree-structured vector quantizer; Algorithm design and analysis; Bandwidth; Communications technology; Data compression; Internet; Multiresolution analysis; Rate distortion theory; Rate-distortion; Source coding; Surges;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 1998. DCC '98. Proceedings
Conference_Location
Snowbird, UT
ISSN
1068-0314
Print_ISBN
0-8186-8406-2
Type
conf
DOI
10.1109/DCC.1998.672131
Filename
672131
Link To Document