Lee Kwang Bae, Kim Hyen Ug, Song Kwang Suk, Kim Jeong Il, Kang Kyeong In, Park Gyong Bae

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 5, pp. 1317-1328, Sep. 1996
10.3745/KIPSTE.1996.3.5.1317,   PDF Download:

Abstract

In this paper, we propose a fast fractal image coding algorithm to shorten long to take on fractal image encoding.　For its performance evaluation, the algorithm compares with other traditional fractal coding methods. In the traditional fractal image coding methods, an original image is contracted by a factor in order to make the corresponding image to be compared with. Then, the whole area of the contracted image is searched in order to find the fixed point of contractive transformation of the original image corresponding to the contracted image. It needs a lot of searching time on encoding. However, the proposed algorithm considerably reduces encoding time by using scaling method and limited search area method. On comparison of the proposed algorithm with Jacquin''s method, the proposed algorithm is at least 180 times as fast as that of Jacquin''s method on encoding time with a little degradation of the decoded image quality and a little increase of the compression rate. Therefore, it is found that the proposed algorithm largely improves the performance in the aspect of encoding time when compared with other fractal image coding methods.

Statistics
Cite this article