A fast rhomb-partitioning fractal image compression method

This paper presents a fast rhomb-partitioning fractal image compression method based on neighbour-searching and block classification. Experiments show that this algorithm can speed the encoding up to 40 times while maintaining reconstructed image quality well.

[1]  O.C.Au,et al.  ADVANCES IN FRACTAL IMAGE AND VIDEO CODING , 1996 .

[2]  Arnaud E. Jacquin,et al.  A novel fractal block-coding technique for digital images , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[3]  Dietmar Saupe,et al.  Accelerating fractal image compression by multi-dimensional nearest neighbor search , 1995, Proceedings DCC '95 Data Compression Conference.

[4]  Li Li,et al.  An efficient fractal image compression method , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.