The color quantization problem solved by swarm-based operations

摘要

The objective of the color quantization problem is to reduce the number of different colors of an image, in order to obtain a new image as similar as possible to the original. This is a complex problem and several solution techniques have been proposed to solve it. Among the most novel solution methods are those that apply swarm-based algorithms. These algorithms define an interesting solution approach, since they have been successfully applied to solve many different problems. This paper presents a color quantization method that combines the Artificial Bee Colony algorithm with the Ant-tree for Color Quantization algorithm, creating an improved version of a previous method that combines artificial bees with the K-means algorithm. Computational results show that the new method significantly reduces computing time compared to the initial method, and generates good quality images. Moreover, this new method generates better images than other well-known color quantization methods such as Wu’s method, Neuquant, Octree or the Variance-based method.