Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16] [ 17] [ 18] [ 19] [ 20]

¡@

Journal of Information Science and Engineering, Vol. 23 No. 2, pp. 629-640 (March 2007)

Direct Allocating the Dihedral Transformation for Fractal Image Compression

D. J. Duh, J. H. Jeng* and S. Y. Chen
 Department of Computer Science and Engineering
Yuan Ze University
Taoyuan, 320 Taiwan
*Department of Information Engineering
I-Shou University
Kaohsiung County, 840 Taiwan

Fractal image compression exploits the self-similarity of an image to achieve the purpose of compression. In the standard algorithm, eight Dihedral transformations are applied on domain blocks to increase the codebook size, and therefore, the quality of reconstructed image can be improved. However, such mechanism consumes approximately eight times of the encoding time. On the other hand, if no transformation is performed in order to speedup the encoder, the image quality will decay because the codebook is not large enough. In this paper, we propose a direct allocating method to predict the desired orientation and the similarity measure is performed on this orientation only. Simulations show that the encoding time is almost the same as that of the method without transformations while the image quality is close to that of the standard method.

Keywords: fractal image compression, PIFS, Dihedral transformation, DCT, AC coefficients

Full Text (¥þ¤åÀÉ) Retrieve PDF document (200703_17.pdf)

Received March 3, 2005; revised May 17, 2005; accepted June 1, 2005.
Communicated by Kuo-Chin Fan.