16 September 1994 Optimal codebook design for a trellis-searched vector quantization
Author Affiliations +
Proceedings Volume 2308, Visual Communications and Image Processing '94; (1994) https://doi.org/10.1117/12.185983
Event: Visual Communications and Image Processing '94, 1994, Chicago, IL, United States
Abstract
This paper proposes a new trellis-searched vector quantization scheme with an optimal codebook design algorithm. The proposed vector quantizer employs a conditional index encoder to efficiently exploit high interblock correlation, where each index is adaptively encoded using a different Huffman table which is selected according to the index of the previously decoded block. We also modify the Viterbit algorithm in order to find the optimal path through the trellis of indices. For an optimal codebook design an iterative descent method is used, which is very similar to that for ECVQ (entropy-constrained vector quantization) codebook design. Simulation results show that at the same bitrate the proposed method provides higher PSNR performances than the conventional ECVQ by 1.0 approximately 3.0 dB when applied to image coding.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Seung Jun Lee, Yong Chang Seo, ChoongWoong Lee, "Optimal codebook design for a trellis-searched vector quantization", Proc. SPIE 2308, Visual Communications and Image Processing '94, (16 September 1994); doi: 10.1117/12.185983; https://doi.org/10.1117/12.185983
PROCEEDINGS
9 PAGES


SHARE
Back to Top