Fast Fractal Image Compression Base on Block Property

Fractal image compression is promising both theoretically and practically. The encoding speed of the traditional full search method is a key factor rendering the fractal image compression unsuitable for real-time application. The primary objective of this paper is to investigate the comprehensive coverage of the principles and techniques of fractal image compression. In this paper, the novel image quality index (structure similarity, SSIM) and block property classifier employed for the fractal image compression is investigated. Experimental results show that the scheme speeds up the encoder 10 times faster and the visual effect is better in comparison to the full search method.

[1]  M. Barnsley,et al.  Recurrent iterated function systems , 1989 .

[2]  Arnaud E. Jacquin,et al.  Image coding based on a fractal theory of iterated contractive image transformations , 1992, IEEE Trans. Image Process..

[3]  David Zhang,et al.  Hybrid image coding based on partial fractal mapping , 2000, Signal Process. Image Commun..

[4]  A. Bovik,et al.  A universal image quality index , 2002, IEEE Signal Processing Letters.

[5]  Chou-Chen Wang,et al.  A fast encoding algorithm for fractal image compression , 2004, IEICE Electron. Express.

[6]  Y. Fisher.  Fractal image compression: theory and application , 1995 .

[7]  Eero P. Simoncelli,et al.  Image quality assessment: from error visibility to structural similarity , 2004, IEEE Transactions on Image Processing.

[8]  Trieu-Kien Truong,et al.  Fast fractal image compression using spatial correlation , 2004 .

[9]  M. Barnsley,et al.  Iterated function systems and the global construction of fractals , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[10]  Chih-ming Kung,et al.  Vision system motion tracking control with high performance motion estimation , 2002, IMTC/2002. Proceedings of the 19th IEEE Instrumentation and Measurement Technology Conference (IEEE Cat. No.00CH37276).