M. Ruhl, H. Hartenstein, D. Saupe. Adaptive partitionings for fractal image compression. In Proc. ICIP-97 IEEE International Conference on Image Processing, Santa Barbara, California, 1997.
In fractal image compression a partitioning of the image into ranges is required. In our previous work [1] we have proposed to find good partitionings by means of a split-and-merge process guided by evolutionary computing. In this approach ranges are connected sets of small square image blocks. Far better rate-distortion curves can be obtained as compared to traditional quadtree partitionings, however, at the expense of an increase of computing time. In this pa-per we show how conventional acceleration techniques and a deterministic version of the evolution reduce the time-complexity of the method without degrading the encoding quality. Furthermore, we report on techniques to improve the rate-distortion performance and evaluate the results vi-sually.
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{RuHaSa97,
Author = {Ruhl, M. and Hartenstein, H. and Saupe, D.},
Title = {Adaptive partitionings for fractal image compression},
BookTitle = {Proc. ICIP-97 IEEE International Conference on Image Processing},
Address = {Santa Barbara, California},
Month = {},
Year = {1997}
}