A new iterative algorithm for VQ codebook generation

We propose a new iterative algorithm for the generation of a codebook in vector quantization. The algorithm starts with an initial codebook that is improved by a sequence of merge and split operations. By merging small neighboring clusters additional resources (code vectors) will be released. These extra code vectors can be reallocated by splitting large clusters. The process can be iterated until no improvement is achieved in the distortion of the codebook. Experimental results show that the proposed method performs well in comparison to other tested methods, including the Generalized Lloyd algorithm (GLA) and two hierarchical methods.

[1]  Kaizhong Zhang,et al.  A better tree-structured vector quantizer , 1991, [1991] Proceedings. Data Compression Conference.

[2]  Olli Nevalainen,et al.  On the splitting method for vector quantization codebook generation , 1997 .

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

[4]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

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

[6]  Olli Nevalainen,et al.  Reallocation of GLA codevectors for evading local minimum , 1996 .

[7]  Pasi Fränti,et al.  Fast implementation of the optimal PNN method , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).