ABSTRACT
In this study, K-means algorithm, a distance-based clustering algorithm, is modified depending on the color quantization application. Each color cluster center is calculated as its weighted mean by using histogram value. This algorithm uses average distortion optimization strategy to improve the perceived image quality on quantized image. In this application we have also used two different color spaces like RGB and CIELab to examine the effect of color spaces on clustering. Our application supports mapping from 256-color to 16-color images to show the results.
PDF References Citation
How to cite this article
Songul Albayrak, 2001. Color Quantization by Modified K-Means Algorithm. Journal of Applied Sciences, 1: 508-511.
DOI: 10.3923/jas.2001.508.511
URL: https://scialert.net/abstract/?doi=jas.2001.508.511
DOI: 10.3923/jas.2001.508.511
URL: https://scialert.net/abstract/?doi=jas.2001.508.511
REFERENCES
- Duda, R.O. and P.E. Hart, 1973. Pattern Classification and Scene Analysis. 2nd Edn., John Wiley and Sons, New York, ISBN: 0-471-22361-1, pp: 482.
Direct Link - Jain, A.K., 1989. Fundamentals of Digital Image Processing. Prentice Hall, Englewood Cliffs, NJ., USA., ISBN-10: 0133361659.
Direct Link