On accelerating fractal compression

Author

Chu, Hsueh-Ting ; Chen, Chaur-Chin

Author_Institution

Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan

fYear

1998

fDate

30 Mar-1 Apr 1998

Firstpage

535

Abstract

Summary form only given. Image data compression by fractal techniques has been widely investigated. Although its high compression ratio and resolution-free decoding properties are attractive, the encoding process is computationally demanding in order to achieve an optimal compression. This article proposes a fast fractal-based encoding algorithm (ACC) by using the intensity changes of neighboring pixels to search for a suboptimal domain block for a given range block. Experimental results show that our algorithm achieves close to the optimal algorithm (OPT) for 256×256 images Jet, Lenna, Mandrill, and Peppers, with a compression ratio of 16. A comparison of the performance of algorithms OPT and ACC on a Sun Ultra 1 Sparc workstation is given

Keywords

data compression; fractals; image coding; optimisation; transform coding; ACC; Jet; Lenna; Mandrill; Peppers; Sun Ultra 1 Sparc workstation; compression ratio; experimental results; fast fractal-based encoding algorithm; fractal compression; high compression ratio; image data compression; intensity changes; neighboring pixels; optimal algorithm; optimal compression; performance; range block; resolution-free decoding; suboptimal domain block; Acceleration; Computer science; Data compression; Decoding; Encoding; Fractals; Image coding; Optimized production technology; Sun; Workstations;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Compression Conference, 1998. DCC '98. Proceedings

Conference_Location

Snowbird, UT

ISSN

1068-0314

Print_ISBN

0-8186-8406-2

Type

conf

DOI

10.1109/DCC.1998.672256

Filename

672256