Vector Quantizationby Lazy Pairwise Nearest Neighbor Method

Clustering of a data set can be done by the well-known Pairwise Nearest Neighbor (PNN) algorithm. The algorithm is conceptionally very simple and gives high quality solutions. A drawback of the method is the relatively large running time of the original (exact) implementation. Recently, an efficient version of the exact PNN algorithm has been introduced in literature. In this paper we give a faster implementation of this algorithm. The idea is to postpone the updating of the nearest neighbor information in order to reduce the number of cluster distance calculations. Correctness of the algorithm follows from the monotony of the cluster distances. Practical tests show that the new organization of the algorithm decreases the running time of PNN by ca. 35 per cent.

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

[2]  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..

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

[4]  P. Fränti,et al.  Iterative split-and-merge algorithm for VQ codebook generation , 1998 .

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

[6]  Kuo-Shu Chang,et al.  Fast PNN algorithm for design of VQ initial codebook , 1998, Electronic Imaging.

[7]  Takio Kurita,et al.  An efficient agglomerative clustering algorithm using a heap , 1991, Pattern Recognit..

[8]  Olli Nevalainen,et al.  Genetic Algorithms for Large-Scale Clustering Problems , 1997, Comput. J..

[9]  G. N. Lance,et al.  A General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems , 1967, Comput. J..

[10]  Philip Ogunbona,et al.  On the computational complexity of the LBG and PNN algorithms , 1997, IEEE Trans. Image Process..

[11]  Michael Randolph Garey,et al.  The complexity of the generalized Lloyd - Max problem , 1982, IEEE Trans. Inf. Theory.

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

[13]  Olli Nevalainen,et al.  Iterative split-and-merge algorithm for vector quantization codebook generation , 1998 .

[14]  Faouzi Kossentini,et al.  A fast PNN design algorithm for entropy-constrained residual vector quantization , 1998, IEEE Trans. Image Process..

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