Title :
Additive successive refinement
Author :
Tuncel, Ertem ; Rose, Kenneth
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA
Abstract :
Scalable coding rate-distortion bounds, and conditions for their coincidence with non-scalable rate-distortion bounds, were derived by W.H.R. Equitz and T.M. Cover (1991) and B. Rimoldi (1994). However, there has always been an implicit assumption of a tree structured vector quantization (TSVQ) scheme, which requires extensive memory usage. On the other hand, in most practical applications, additive structures such as multi-stage vector quantization (MSVQ) are preferred. In this paper, we analyze the bounds for MSVQ
Keywords :
rate distortion theory; source coding; vector quantisation; MSVQ; additive structures; additive successive refinement; discrete memoryless source; multi-stage vector quantization; scalable coding rate-distortion bounds; tree structured vector quantization; Additives; Decoding; Encoding; Laboratories; Random variables; Rate-distortion; Streaming media; Sufficient conditions; Vector quantization; Yttrium;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.935894
