Share Email Print
cover

Proceedings Paper

Optimal codebook design for a trellis-searched vector quantization
Author(s): Seung Jun Lee; Yong Chang Seo; ChoongWoong Lee
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 16 September 1994
PDF: 9 pages
Proc. SPIE 2308, Visual Communications and Image Processing '94, (16 September 1994); doi: 10.1117/12.185983
Show Author Affiliations
Seung Jun Lee, Seoul National Univ. (South Korea)
Yong Chang Seo, Korea Telecom (South Korea)
ChoongWoong Lee, Seoul National Univ. (South Korea)


Published in SPIE Proceedings Vol. 2308:
Visual Communications and Image Processing '94
Aggelos K. Katsaggelos, Editor(s)

© SPIE. Terms of Use
Back to Top