Region-based fractal image compression using heuristic search

Presents work carried out on fractal (or attractor) image compression. The approach relies on the assumption that image redundancy can be efficiently exploited through self-transformability. The algorithms described utilize a novel region-based partition of the image that greatly increases the compression ratios achieved over traditional block-based partitionings. Due to the large search spaces involved, heuristic algorithms are used to construct these region-based transformations. Results for three different heuristic algorithms are given. The results show that the region-based system achieves almost double the compression ratio of the simple block-based system at a similar decompressed image quality. For the Lena image, compression ratios of 41:1 can be achieved at a PSNR of 26.56 dB.

[1]  J. M. Beaumont.  Advances in block based fractal coding of still pictures , 1990 .

[2]  B. Mandelbrot.  Fractal Geometry of Nature , 1984 .

[3]  Tor A. Ramstad,et al.  An inner product space approach to image coding by contractive transformations , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[4]  Michael F. Barnsley,et al.  A better way to compress images , 1988 .

[5]  Thomas S. Huang,et al.  A fractal-based image block-coding algorithm , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[6]  Donald M. Monro,et al.  Fractal block coding of images , 1992 .

[7]  Monson H. Hayes,et al.  Adaptive IFS image coding with proximity maps , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[8]  Donald M. Monro,et al.  A hybrid fractal transform , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[9]  Farzin Deravi,et al.  Pruning of the transform space in block-based fractal image compression , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[10]  D. M. Monro,et al.  Fractal approximation of image blocks , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

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

[12]  Michael F. Barnsley,et al.  Fractals everywhere , 1988 .

[13]  M. Barnsley,et al.  Solution of an inverse problem for fractals and other sets. , 1986, Proceedings of the National Academy of Sciences of the United States of America.

[14]  Alfredo De Santis,et al.  Minimum codeword length and redundancy of Huffman codes , 1990, EUROCODE.

[15]  A. Jacquin.  A fractal theory of iterated Markov operators with applications to digital image coding , 1989 .

[16]  M. Barnsley.  Fractal modelling of real world images , 1988 .

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

[18]  Tor A. Ramstad,et al.  Attractor image compression with a fast non-iterative decoding algorithm , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[19]  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.