Sub-optimal Fractal Coding Scheme Using Iterative Transformation 


Vol. 27,  No. 3, pp. 231-239, Mar.  2002


PDF
  Abstract

This paper presents a new fractal coding scheme to find sub-optimal transformation by performing an iterative encoding process. An optimal transformation can be defined as the transformation generating the attractor which is closest to an original image. Unfortunately, it has been well-known that it is actually impossible to find the optimal transformation due to heavy computation. In this paper, however, by means of some new theorems related with the fractal transformation and the attractor, it is shown that for a special case the optimal transformation can be obtained as well as for a general case the sub-optimal transformation. The proposed method based on the theorems obtains the sub-optimal transformation performing an iterative process as if done in decoding. Thus, it requires more computation than the conventional method but improves the image quality. We verify the superiority of the proposed method through the experimental results for real images, which shows that the proposed method approaches to the optimal method in the performance and is superior to the conventional method.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Kang and S. Hong, "Sub-optimal Fractal Coding Scheme Using Iterative Transformation," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 3, pp. 231-239, 2002. DOI: .

[ACM Style]

Hyun-Soo Kang and Sung-Hoon Hong. 2002. Sub-optimal Fractal Coding Scheme Using Iterative Transformation. The Journal of Korean Institute of Communications and Information Sciences, 27, 3, (2002), 231-239. DOI: .

[KICS Style]

Hyun-Soo Kang and Sung-Hoon Hong, "Sub-optimal Fractal Coding Scheme Using Iterative Transformation," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 3, pp. 231-239, 3. 2002.