Evolutionary fractal image compression
- 23 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 129-132
- https://doi.org/10.1109/icip.1996.559449
Abstract
This paper introduces evolutionary computing to frac- tal image compression. In fractal image compression (1) a partitioning of the image into ranges is required. We propose to use evolutionary computing to nd good partitionings. Here ranges are connected sets of small square image blocks. Populations consist of Np cong- urations, each of which is a partitioning with a fractal code. In the evolution each conguration produces children who inherit their parent partitionings except for two random neighboring ranges which are merged. From the ospring the best ones are selected for the next generation population based on a tness crite- rion (collage error). We show that a far better rate- distortion curve can be obtained with this approach as compared to traditional quad-tree partitionings.Keywords
This publication has 5 references indexed in Scilit:
- Lossless acceleration of fractal image compression by fast convolutionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fractal image compression based on Delaunay triangulation and vector quantizationIEEE Transactions on Image Processing, 1996
- Region-based fractal image compression using heuristic searchIEEE Transactions on Image Processing, 1995
- Image compression: A study of the iterated transform methodSignal Processing, 1992
- Image coding based on a fractal theory of iterated contractive image transformationsIEEE Transactions on Image Processing, 1992