K-means-based color palette design scheme with the use of stable flags
- 1 July 2007
- journal article
- Published by SPIE-Intl Soc Optical Eng in Journal of Electronic Imaging
- Vol. 16 (3), 033003-033003-11
- https://doi.org/10.1117/1.2762241
Abstract
We propose a fast palette design scheme based on the K-means algorithm for color image quantization. To accelerate the K-means algorithm for palette design, the use of stable flags for palette entries is introduced. If the squared Euclidean distances incurred by the same palette entry in two successive rounds are quite similar, the palette entry is classified to be stable. The clustering process will not work on these stable palette entries to cut down the required computational cost. The experimental results reveal that the proposed algorithm consumes a lower computational cost than those comparative schemes while keeping approximately the same image quality.Keywords
This publication has 15 references indexed in Scilit:
- A fuzzy algorithm for color quantization of imagesPattern Recognition, 2002
- An efficient k-means clustering algorithm: analysis and implementationIeee Transactions On Pattern Analysis and Machine Intelligence, 2002
- A fast and novel technique for color quantization using reduction of color space dimensionalityPattern Recognition Letters, 2001
- An adaptive clustering algorithm for color quantizationPattern Recognition Letters, 2000
- A comparison of clustering algorithms applied to color image quantizationPattern Recognition Letters, 1997
- A genetic c-Means clustering algorithm applied to color image quantizationPattern Recognition, 1997
- RWM-cut for color image quantizationComputers & Graphics, 1996
- Variance‐based color image quantization for frame buffer displayColor Research & Application, 1990
- On the color image segmentation algorithm based on the thresholding and the fuzzy c-means techniquesPattern Recognition, 1990
- Color image quantization for frame buffer displayACM SIGGRAPH Computer Graphics, 1982