Novel vector quantiser design using reinforced learning as a pre-process

This paper presents the development and evaluation of a new approach toward the design of optimised codebooks by vector quantisation (VQ). A strategy of reinforced learning (RL) is proposed which exploits the advantages offered by fuzzy clustering algorithms, competitive learning and knowledge of training vector and codevector configurations. RL is used as a pre-process before using a conventional VQ algorithm such as the generalised Lloyd algorithm (GLA) or the fuzzy k-means (FKM) algorithm. At each iteration of RL, codevectors move intelligently and intentionally toward an improved optimum codebook design. This is distinct from simulated annealing (SA) and genetic algorithm (GA) techniques in which a random variation is introduced in the movement of the codevectors. The new strategy reduces the possibility that, in the final design, codevectors will be overcrowded in the high density distribution regions of the training vector space, and also that too few codevectors will be settled in low density regions. Experiments demonstrate that this results in a more effective representation of the training vectors by the codevectors and that the final codebook is nearer to the optimal solution in applications such as image compression. It has been found that GLA and FKM yield improved quality of codebook design in this application when RL is used as a pre-process. The investigations have also indicated that RL is insensitive to the selection of both the initial codebook and a learning rate control parameter, which is the only additional parameter introduced by RL from the standard FKM.

[1]  J. C. Dunn,et al.  A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters , 1973 .

[2]  Paul Scheunders,et al.  A genetic c-Means clustering algorithm applied to color image quantization , 1997, Pattern Recognit..

[3]  N.B. Karayiannis,et al.  Fuzzy vector quantization algorithms and their application in image compression , 1995, IEEE Trans. Image Process..

[4]  Asoke K. Nandi,et al.  A new fuzzy reinforcement learning vector quantization algorithm for image compression , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..

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

[6]  Allen Gersho,et al.  Competitive learning and soft competition for vector quantizer design , 1992, IEEE Trans. Signal Process..

[7]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[9]  Nicolaos B. Karayiannis,et al.  Fuzzy algorithms for learning vector quantization , 1996, IEEE Trans. Neural Networks.

[10]  Allen Gersho,et al.  Globally optimal vector quantizer design by stochastic relaxation , 1992, IEEE Trans. Signal Process..

[11]  Geoffrey C. Fox,et al.  Constrained Clustering as an Optimization Method , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  James C. Bezdek,et al.  Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.

[13]  Bart Kosko,et al.  Differential competitive learning for centroid estimation and phoneme recognition , 1991, IEEE Trans. Neural Networks.

[14]  Teuvo Kohonen,et al.  Self-organization and associative memory: 3rd edition , 1989 .

[15]  Dong-Chul Park,et al.  Centroid neural network for unsupervised competitive learning , 2000, IEEE Trans. Neural Networks Learn. Syst..

[16]  James C. Bezdek,et al.  Generalized clustering networks and Kohonen's self-organizing scheme , 1993, IEEE Trans. Neural Networks.

[17]  J. Bezdek,et al.  FCM: The fuzzy c-means clustering algorithm , 1984 .