Color image quantization by minimizing the maximum intercluster distance
ACM Transactions on Graphics (TOG)
A comparison of clustering algorithms applied to color image quantization
Pattern Recognition Letters - special issue on pattern recognition in practice V
Color image fidelity metrics evaluated using image distortion maps
Signal Processing - Special issue on image and video quality metrics
Color image quantization for frame buffer display
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
Interval Set Clustering of Web Users with Rough K-Means
Journal of Intelligent Information Systems
An adjustable algorithm for color quantization
Pattern Recognition Letters
Some refinements of rough k-means clustering
Pattern Recognition
New adaptive color quantization method based on self-organizing maps
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
Colour quantisation algorithms are essential for displaying true colour images using a limited palette of distinct colours. The choice of a good colour palette is crucial as it directly determines the quality of the resulting image. Colour quantisation can also be seen as a clustering problem where the task is to identify those clusters that best represent the colours in an image. In this paper, we use a rough c-means clustering algorithm for colour quantisation of images. Experimental results on a standard set of images show that this rough colour quantisation approach performs significantly better than other, purpose built colour reduction algorithms.