JACIII Vol.9 No.1 pp. 80-88
doi: 10.20965/jaciii.2005.p0080


Fractal Image Coding with Simulated Annealing Search

Shen Furao*, and Osamu Hasegawa**

*Department of Computational Intelligence and Systems Science, Tokyo Institute of Technology (TIT)
R2-52 Imaging Science and Engineering Lab., 4259 Nagatsuta, Midori-ku, Yokohama 226-8503, Japan

**Imaging Science and Engineering Lab., Tokyo Institute of Technology, 4259 Nagatsuta, Midori-ku, Yokohama, Kanagawa 226-8503, Japan

July 8, 2004
November 30, 2004
January 20, 2005
fractal image coding, simulated annealing, global optimal searching, iterated function system (IFS)
The main shortcomings of fractal image coders are (1) the slow speed for searching domain block pool, and (2) known fast algorithms leading to a loss of image quality. We propose efficient fractal image coding using simulated annealing method. Compared to previous schemes, our proposal greatly increases the search speed of domain block pool with almost no image quality loss. Experimental results indicate the high feasibility of the proposed method, which is, furthermore, extendable to other fractal coders.
Cite this article as:
S. Furao and O. Hasegawa, “Fractal Image Coding with Simulated Annealing Search,” J. Adv. Comput. Intell. Intell. Inform., Vol.9 No.1, pp. 80-88, 2005.
Data files:

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, Opera.

Last updated on Jun. 19, 2024