Previous [1] [2] [3] [4] [5] [6] [7] [8] [9] [10]

Journal of Inforamtion Science and Engineering, Vol.17 No.3, pp.417-427 (May 2001)

Accelerating Fractal Compression With a Real-time Decoder*


Hsueh-Ting Chu and Chaur-Chin Chen

Department of Computer Science
National Tsing Hua University
Hsinchu, Taiwan 300, R.O.C.
E-mail: cchen@cs.nthu.edu.tw

Image data compression by fractal techniques has been widely investigated. Although its high compression ratio and resolution-independent decoding properties are attractive, the encoding process is computationally demanding in order to achieve an optimal compression. A variety of speed-up algorithms have been proposed since Jacquin published a novel fractal coding algorithm. Unfortunately, the quantization strategy of scaling coefficients and the programming techniques lead to the results reported by different researchers are various even on the same image data which causes the speed-up of compression is incomparable. This paper proposes a real-time fractal decoder as a standard. We report the implementation results of a nearly optimal encoding algorithm OPT on commonly used images: Jet, Lenna, Mandrill, and Peppers of size 512?512. An accelerating compression algorithm using maximum gradient MG is shown to be 1300 times faster than OPT with a slight drop of PSNR value when encoding a 512?512 image.

Keywords: IFS, maximum gradient, fast encoder, simple decoder, collage theorem

Full Text () Retrieve PDF document (200105_04.pdf)

Received June 2, 1999; revised March 15, 2000; accepted May 2, 2000.
Communicated by Zen Chen.
*This work was partially supported by NSC 88-2213-E-007-051.