R. Hamzaoui, D. Saupe, M. Hiller. Fast code enhancement with local search for fractal image compression. In Proc. ICIP-2000 IEEE International Conference on Image Processing, Vancouver, 2000.
Optimal fractal coding consists of finding in a finite set of contrac-tive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is an NP-hard combina-torial optimization problem. Conventional coding is based on a greedy suboptimal algorithm known as collage coding. In a previ-ous study, we proposed a local search algorithm that significantly improves on collage coding. However, the algorithm, which re-quires the computation of many fixed points, is computationally expensive. In this paper, we provide techniques that drastically reduce the time complexity of the algorithm.
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{HaSaHi00,
Author = {Hamzaoui, R. and Saupe, D. and Hiller, M.},
Title = {Fast code enhancement with local search for fractal image compression},
BookTitle = {Proc. ICIP-2000 IEEE International Conference on Image Processing},
Address = {Vancouver},
Month = {},
Year = {2000}
}