Abstract
The aim of colour quantisation is to reduce the number of distinct colour in images while preserving a high colour fidelity as compared to the original images. 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 investigate the performance of various fuzzy c-means clustering algorithms for colour quantisation of images. In particular, we use conventional fuzzy c-means as well as some more efficient variants thereof, namely fast fuzzy c-means with random sampling, fast generalised fuzzy c-means, and a recently introduced anisotropic mean shift based fuzzy c-means algorithm. Experimental results show that fuzzy c-means performs significantly better than other, purpose built colour quantisation algorithms, and also confirm that the fast fuzzy clustering algorithms provide similar quantisation results to the full conventional fuzzy c-means approach.
Original language | English |
---|---|
Pages (from-to) | 17-25 |
Number of pages | 9 |
Journal | Telecommunication Systems |
Volume | 40 |
Issue number | 1-2 |
Early online date | 11 Oct 2008 |
DOIs | |
Publication status | Published - Feb 2009 |
Keywords
- Colour palette
- Colour quantisation
- Fuzzy c-means
- Fuzzy clustering