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

@

Journal of Information Science and Engineering, Vol. 28 No. 1, pp. 17-30 (January 2012)

Fast Search Strategies for Fractal Image Compression*

YIH-LON LIN AND WEN-LIN CHEN
Department of Information Engineering
I-Shou University
Kaohsiung, 840 Taiwan

In traditional fractal image compression, the encoding procedure is time-consuming due to the full search mechanism. In order to speedup the encoder, we adopt particle swarm optimization method performed under classification and Dihedral transformation to further decrease the amount of MSE computations. The classifier partitions all of the blocks in domain pool and range pool into three classes according to the third level wavelet coefficients. Each range block searches the most similar block only from the blocks of the same class. Furthermore, according to the property of Dihedral transformation, only four transformations for each domain block are considered so as to reduce the encoding time. Experimental results show that, the encoding time of the proposed method is faster than that of the full search method. Experimental results show that the proposed method is about 178 times faster with only 1.46 dB decay in image quality.

Keywords: fractal image compression, particle swarm optimization, classification, Dihedral transformation, discrete wavelet transform

Full Text () Retrieve PDF document (201201_02.pdf)

Received February 9, 2012; revised August 15, 2012; accepted August 28, 2012.
Communicated by Yuh-Jye Lee.
* The research was supported by the National Science Council, Taiwan, under Grant No. NSC 99-2221-E-214-056.