Revisiting the Iterative Ant-tree for color quantization algorithm

The Iterative Ant-tree for color quantization algorithm has recently been proposed to reduce the colors of an image at a low computational cost. It is a clustering-based method that generates good images compared to several well-known color quantization methods. This article proposes the modificatio...

Full description

Saved in:
Bibliographic Details
Published in:Journal of visual communication and image representation 2021-07, Vol.78, p.103180, Article 103180
Main Author: Pérez-Delgado, María-Luisa
Format: Article
Language:English
Subjects:
Artificial ants
Clustering
Color quantization
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Iterative Ant-tree for color quantization algorithm has recently been proposed to reduce the colors of an image at a low computational cost. It is a clustering-based method that generates good images compared to several well-known color quantization methods. This article proposes the modification of two features of the original algorithm: the value assigned to the parameter associated with the algorithm and the order in which the pixels of the image are processed. As a result, the new variant of the algorithm generates better images than the original and the results are less sensitive to the value selected for the parameter. [Display omitted] •The Iterative Ant-tree for color quantization method is improved.•Better images are always obtained with only a little more execution time.•The final image is less influenced by the parameter associated with the method.•Generates better images than some well-known color quantization methods.
ISSN:1047-3203
1095-9076
DOI:10.1016/j.jvcir.2021.103180