D. Saupe, M. Ruhl. Evolutionary fractal image compression. In Proc. ICIP-96 IEEE International Conference on Image Processing, Lausanne, 1996.
This paper introduces evolutionary computing to fractal image compression. In fractal image compression [1] a partitioning of the image into ranges is required. We propose to use evolutionary computing to find good partitionings. Here ranges are connected sets of small square image blocks. Populations consist of Np configurations, each of which is a partitioning with a fractal code. In the evolution each configuration produces ( children who inherit their parent partitionings except for two random neighboring ranges which are merged. From the offspring the best ones are selected for the next generation population based on a fitness criterion (collage error). We show that a far better ratedistortion curve can be obtained with this approach as compared to traditional quad-tree partitionings.
Download paper:
Adobe PDF
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
@InProceedings{SaRu96a,
Author = {Saupe, D. and Ruhl, M.},
Title = {Evolutionary fractal image compression},
BookTitle = {Proc. ICIP-96 IEEE International Conference on Image Processing},
Address = {Lausanne},
Month = {},
Year = {1996}
}