A Hybrid Color Image Quantization Algorithm Based on K-means and Harmony Search Algorithms | ||||
| Port-Said Engineering Research Journal | ||||
| Article 14, Volume 19, Issue 1, March 2015, Page 129-136 PDF (1.05 MB) | ||||
| Document Type: Original Article | ||||
| DOI: 10.21608/pserj.2015.36801 | ||||
 View on SCiNiTO | ||||
| Authors | ||||
| Rehab AbdElkader1; Mohamed Yasein2; Asmaa Khaled3 | ||||
| 11Assoc. Prof, Electrical Engineering Department, computer and control Section, Faculty of Engineering, Port Said University, Port Said, Egypt | ||||
| 2Lecturer, Electrical Engineering Department, computer and control Section, Faculty of Engineering, Port Said University, Port Said, Egypt | ||||
| 3Demonstrator, Electrical Engineering Department, computer and control Section, Faculty of Engineering, Port Said University, Port Said, Egypt | ||||
| Abstract | ||||
| The importance of color image quantization is reduce the number of different colors in an image with minimum distortion so, it is one of the most important operations in the computer graphics and image processing. In this paper, a new algorithm for color image quantization based on a stand-alone harmony search (HS) algorithm is proposed as a first new algorithm. The second algorithm is a hybrid algorithm of K-means and HS. This algorithm is based on a clustering method. Clustering method is one of the most commonly used methods in color image quantization. Investigations results on some of the most commonly used test images in the quantization literature the experiences obtained with these proposed algorithms give high quality images compared with other methods. | ||||
| Keywords | ||||
| Color quantization; Harmony search; K-means | ||||
|
Statistics Article View: 134 PDF Download: 282 |
||||
