Title :
Successively refinable trellis coded quantization
Author :
Jafarkhani, Hamid ; Tarokh, Vahid
Author_Institution :
Dept. of Res., AT&T Labs., Red Bank, NJ, USA
fDate :
30 Mar-1 Apr 1998
Abstract :
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 refillability. 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 performance for memoryless sources
Keywords :
computational complexity; decoding; quantisation (signal); rate distortion theory; source coding; algorithms; computational complexity; decoding; embedded bit streams; encoding rate; hierarchical set partitioning; memoryless sources; performance; progressive transmission; rate distortion function; scalable trellis structure; simulation results; source coders; successively refinable trellis coded quantization; trellis coded quantization; Algorithm design and analysis; Channel coding; Computational complexity; Computational modeling; Entropy; Image coding; Noise level; Partitioning algorithms; Quantization; Rate-distortion;
Conference_Titel :
Data Compression Conference, 1998. DCC '98. Proceedings
Conference_Location :
Snowbird, UT
Print_ISBN :
0-8186-8406-2
DOI :
10.1109/DCC.1998.672134
