Center-cut for color-image quantization
The Visual Computer: International Journal of Computer Graphics
Color image quantization by minimizing the maximum intercluster distance
ACM Transactions on Graphics (TOG)
Color image quantization for frame buffer display
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
Neural Networks - 2006 Special issue: Advances in self-organizing maps--WSOM'05
Improving the performance of k-means for color quantization
Image and Vision Computing
`Neural-gas' network for vector quantization and its application to time-series prediction
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
Color quantization is an important operation with many applications in graphics and image processing. Clustering methods based on the competitive learning paradigm, in particular self-organizing maps, have been extensively applied to this problem. In this paper, we investigate the performance of the batch neural gas algorithm as a color quantizer. In contrast to self-organizing maps, this competitive learning algorithm does not impose a fixed topology and is insensitive to initialization. Experiments on publicly available test images demonstrate that, when initialized by a deterministic preclustering method, the batch neural gas algorithm outperforms some of the most popular quantizers in the literature.