An ACO algorithm for image compression

Authors

  • Cristian Martinez University of Buenos Aires, Department of Computer Science

DOI:

https://doi.org/10.19153/cleiej.9.2.1

Keywords:

Algorithms, Image Compression, Fractals, Metaheuristics

Abstract

This paper is an application of Ant Colony Metaheuristic (ACO) to the problem of image fractal compression using IFS. An ACO hybrid algorithm is proposed for image fractal compression and the results obtained are shown. According to the tests carried out, the proposed algorithm offers images with similar quality to that obtained with a deterministic method, in about 34% less time.

Downloads

Published

2006-12-01

Issue

Vol. 9 No. 2 (2006): Regular Issue and Special Issue of Best Papers presented at CLEI 2005, Cali, Colombia. Special Issue Guest Editor: Camilo Rueda

Section

Articles

License

CLEIej is supported by its home institution, CLEI, and by the contribution of the Latin American and international researchers community, and it does not apply any author charges whatsoever for submitting and publishing. Since its creation in 1998, all contents are made publicly accesibly. The current license being applied is a (CC)-BY license (effective October 2015; between 2011 and 2015 a (CC)-BY-NC license was used).