1 July 2007 K-means-based color palette design scheme with the use of stable flags
YuChen Hu, Ming-Gong Lee
Author Affiliations +
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.
©(2007) Society of Photo-Optical Instrumentation Engineers (SPIE)
YuChen Hu and Ming-Gong Lee "K-means-based color palette design scheme with the use of stable flags," Journal of Electronic Imaging 16(3), 033003 (1 July 2007). https://doi.org/10.1117/1.2762241
Published: 1 July 2007
Lens.org Logo
CITATIONS
Cited by 46 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image quality

Distortion

Image compression

Quantization

Image processing

Detection and tracking algorithms

Image processing algorithms and systems

RELATED CONTENT

Finite-state residual vector quantizer for image coding
Proceedings of SPIE (October 22 1993)
Two-pass side-match finite-state vector quantization
Proceedings of SPIE (April 21 1995)
Feedback-based quantization of color images
Proceedings of SPIE (March 23 1994)

Back to Top