Conditional entropy-constrained vector quantization of displaced frame difference subband signals

We study the performance of conditional entropy-constrained vector quantizers when used to quantize subbands of the displaced frame differences derived from video sequences. Chou and Lookabaugh (1990) originally suggested a locally optimal design of this new kind of vector quantizer which can be accomplished through a generalization of the well known entropy-constrained vector quantizer (ECVQ) algorithm. This generalization of the ECVQ algorithm to a conditional entropy-constrained is called CECVQ, i.e., conditional ECVQ. The non-memoryless quantization performed by the conditional entropy-constrained VQ is based on the current vector to be encoded and the previous encoded vector. A new algorithm for conditional entropy-constrained vector quantizer design is derived and it is based on the pairwise nearest neighbour technique presented by Equitz (1989).<<ETX>>

[1]  Philip A. Chou,et al.  Entropy-constrained vector quantization , 1989, IEEE Trans. Acoust. Speech Signal Process..

[2]  William Equitz,et al.  A new vector quantization clustering algorithm , 1989, IEEE Trans. Acoust. Speech Signal Process..

[3]  William A. Pearlman,et al.  A clustering algorithm for entropy-constrained vector quantizer design with applications in coding image pyramids , 1995, IEEE Trans. Circuits Syst. Video Technol..

[4]  William A. Pearlman,et al.  Vector quantization of image pyramids with the ECPNN algorithm , 1991, Other Conferences.

[5]  Philip A. Chou,et al.  Conditional entropy-constrained vector quantization of linear predictive coefficients , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[6]  Robert M. Gray,et al.  An Algorithm for Vector Quantizer Design , 1980, IEEE Trans. Commun..

[7]  Eve A. Riskin,et al.  Optimal bit allocation via the generalized BFOS algorithm , 1991, IEEE Trans. Inf. Theory.