Pruning of the transform space in block-based fractal image compression

A method for fractal image compression is presented which is an extension of A.E. Jacquin's (1990) algorithm. The proposed algorithm improves Jacquin's block-based algorithm by allowing irregularly shaped fractal transformations. The method for producing these transformations is to start with the block-based approach and then prune the transformations in the transform space. The results show a large improvement in compression ratio over Jacquin's system at the same signal-to-noise ratio. For high compression ratios the system has similar performance to the JPEG (Joint Photographic Experts Group) standard.<<ETX>>

[1]  Gregory K. Wallace,et al.  The JPEG still picture compression standard , 1992 .

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

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

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

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

[6]  Gregory K. Wallace,et al.  JPEG still picture compression algorithm , 1991 .

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

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

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