Likelihood codebook reordering vector quantization

In this paper, a reordering vector quantization algorithm based on conditional probabilities of a codebook transition matrix is implemented. The dynamic reordering of the codebook dramatically decreases the entropy for temporally structured sources, enabling a second stage of entropy coding to further improve the efficiency of VQ. Results from synthetic, Markov sources and speech sources are shown to outperform other baseline vector quantization algorithms.

[1]  Daniele D. Giusto,et al.  DCRVQ: a new strategy for efficient entropy coding of vector-quantized images , 1996, IEEE Trans. Commun..

[2]  R. Gray,et al.  Vector quantization , 1984, IEEE ASSP Magazine.

[3]  Nasser M. Nasrabadi,et al.  Image coding using vector quantization: a review , 1988, IEEE Trans. Commun..

[4]  Y. Feng,et al.  A dynamic finite-state vector quantization scheme , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[5]  Robert M. Gray,et al.  Finite-state vector quantization for waveform coding , 1985, IEEE Trans. Inf. Theory.

[6]  Venkatesh Krishnan,et al.  A framework for low bit-rate speech coding in noisy environment , 2005 .

[7]  Guobin Shen,et al.  An efficient codebook post-processing technique and a window-based fast-search algorithm for image vector quantization , 2000, IEEE Trans. Circuits Syst. Video Technol..

[8]  G. Vernazza,et al.  A Framework For High-Compression Coding Of Color Images , 1989, Other Conferences.