Color quantization with genetic algorithms

作者:

Highlights:

摘要

The need for quantization of color images arises because of limitations of image display and hardcopy, data storage and data transmission devices. Many of the present algorithms for color quantization find non-optimal solutions, giving rise to visible shifts in color and false contours when the number of quantization colors is small. This paper describes a new approach to finding the optimal solutions of the color image quantization problem using a genetic algorithm. The nature and the difficulty of the problem and its formulation are discussed. Then genetic algorithms (GAs) are presented and the representation of the problem with this method is explained. The effect of the parameters such as mutation and crossover probabilities and population size on the quality of solutions is studied. Solutions obtained with genetic algorithms are compared with those of heuristics and the K-means clustering algorithm and the superior quality of the results of the GA is shown.

论文关键词:Color image quantization,Genetic algorithms,Clustering

论文评审过程:Received 28 August 1995, Available online 19 June 1998.

论文官网地址:https://doi.org/10.1016/S0923-5965(97)00035-0