Entropy-constrained learning vector quantization algorithms and their application in image compression

Abstract

This paper presents entropy-constrained learning vector quantization (ECLVQ) algorithms and their application in image compression. The development of these algorithms relies on refor- mulation, which is a powerful new methodology that essentially es- tablishes a link between learning vector quantization and clustering algorithms developed using alternating optimization. ECLVQ algo- rithms are developed in this paper by reformulating entropy- constrained fuzzy clustering (ECFC) algorithms, which were devel- oped by minimizing an objective function incorporating the partition entropy and the average distortion between the feature vectors and their prototypes. The proposed algorithms allow the gradual transi- tion from a maximally fuzzy partition to a nearly crisp partition of the feature vectors during the learning process. This paper presents two alternative implementations of the proposed algorithms, which differ in terms of the strategy employed for updating the prototypes during learning. The proposed algorithms are tested and evaluated on the design of codebooks used for image data compression. © 2000 SPIE and IS&T. (S1017-9909(00)00304-4)