An adaptive codebook design using the branching competitive learning network

This paper presents an adaptive scheme for codebook design by using a self-creating neural network, called branching competitive learning network. In our scheme, not only codevectors, but also codebook size are adaptively modified according to input image data and a distortion tolerance. In the situation that the input image is visually simple or the image data have a centralized distribution, our codebook design algorithm will assign a relatively small codebook; and for a complex image, our algorithm will give a relatively large codebook. Experimental results are given to illustrate the adaptability and effectiveness of our scheme.

[1]  Teuvo Kohonen,et al.  Self-Organization and Associative Memory , 1988 .

[2]  Erkki Oja,et al.  Rival penalized competitive learning for clustering analysis, RBF net, and curve detection , 1993, IEEE Trans. Neural Networks.

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

[4]  Duane DeSieno,et al.  Adding a conscience to competitive learning , 1988, IEEE 1988 International Conference on Neural Networks.

[5]  Lai-Man Po,et al.  Minimax partial distortion competitive learning for optimal codebook design , 1998, IEEE Trans. Image Process..

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

[7]  Stanley C. Ahalt,et al.  Competitive learning algorithms for vector quantization , 1990, Neural Networks.

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