Successively refinable trellis coded quantization
Publication
, Conference
Jafarkhani, H; Tarokh, V
Published in: Data Compression Conference Proceedings
January 1, 1998
We propose successively refinable trellis coded quantizers which are suitable for progressive transmission. A new trellis structure which is scalable is used in the design of our trellis coded quantizers. A hierarchical set partitioning is used to preserve successive refinability. Two algorithms for designing trellis coded quantizers which provide embedded bit streams are provided. The computational complexity of the proposed schemes is compared with that of trellis coded quantization. Simulation results show good performances for memoryless sources.
Duke Scholars
Published In
Data Compression Conference Proceedings
ISSN
1068-0314
Publication Date
January 1, 1998
Start / End Page
83 / 92
Citation
APA
Chicago
ICMJE
MLA
NLM
Jafarkhani, H., & Tarokh, V. (1998). Successively refinable trellis coded quantization. In Data Compression Conference Proceedings (pp. 83–92).
Jafarkhani, H., and V. Tarokh. “Successively refinable trellis coded quantization.” In Data Compression Conference Proceedings, 83–92, 1998.
Jafarkhani H, Tarokh V. Successively refinable trellis coded quantization. In: Data Compression Conference Proceedings. 1998. p. 83–92.
Jafarkhani, H., and V. Tarokh. “Successively refinable trellis coded quantization.” Data Compression Conference Proceedings, 1998, pp. 83–92.
Jafarkhani H, Tarokh V. Successively refinable trellis coded quantization. Data Compression Conference Proceedings. 1998. p. 83–92.
Published In
Data Compression Conference Proceedings
ISSN
1068-0314
Publication Date
January 1, 1998
Start / End Page
83 / 92