An adaptive clustering algorithm for color quantization

作者: Ing-Sheen Hsieh , Kuo-Chin Fan

DOI: 10.1016/S0167-8655(99)00165-8

关键词:

摘要: Abstract In this paper, a novel adaptive clustering algorithm for color image quantization is presented. our approach, superposed 3D histogram calculated first. Then, the sorted list fed into an to extract palette colors in image. Finally, destined pixel-mapping applied classify pixels their corresponding colors. The quantized error of proposed very small due combination reduced RGB space utilization and algorithm. Besides, executing speed also quite fast space, list, suitable design pixel mapping. Experimental results reveal feasibility superiority approach solving problem.

参考文章(16)
Xiaolin Wu, Ian H. Witten, A FAST K-MEANS TYPE CLUSTERING ALGORITHM University of Calgary. ,(1985) , 10.11575/PRISM/31135
Julius T. Tou, Rafael C. Gonzalez, Pattern recognition principles ,(1974)
P. Scheunders, A comparison of clustering algorithms applied to color image quantization Pattern Recognition Letters. ,vol. 18, pp. 1379- 1384 ,(1997) , 10.1016/S0167-8655(97)00116-5
Zhigang Xiang, Color image quantization by minimizing the maximum intercluster distance ACM Transactions on Graphics. ,vol. 16, pp. 260- 276 ,(1997) , 10.1145/256157.256159
Mehmet Celenk, A color clustering technique for image segmentation Graphical Models \/graphical Models and Image Processing \/computer Vision, Graphics, and Image Processing. ,vol. 52, pp. 145- 170 ,(1990) , 10.1016/0734-189X(90)90052-W
S. J. Wan, P. Prusinkiewicz, S. K. M. Wong, Variance-based color image quantization for frame buffer display Color Research & Application. ,vol. 15, pp. 52- 58 ,(1990) , 10.1002/COL.5080150109
Gregory Joy, Zhigang Xiang, Center-cut for color-image quantization The Visual Computer. ,vol. 10, pp. 62- 66 ,(1993) , 10.1007/BF01905532