Skip to main content
Log in

Fast Iterative Methods for Fractal Image Compression

  • Published:
Journal of Mathematical Imaging and Vision Aims and scope Submit manuscript

Abstract

In fractal image compression, a digital image is approximated by the unique fixed point of a contractive affine mapping. The decoding consists of iterating the affine mapping starting from an arbitrary image until convergence to the fixed point. We show that the decoding can be accelerated by using the new pixel intensities of an image iterate as soon as they become available. We provide a mathematical formulation of the proposed decoding and prove its convergence in a general setting. We show that under some mild restrictions the asymptotic rate of convergence of the proposed method is greater than or equal to that of the conventional method. We also discuss the use of standard iterative methods for the decoding. Finally, we show that the convergence of the proposed method can be enhanced by an ordering technique.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A.E. Jacquin, “Image coding based on a fractal theory of iterated contractive image transformations,” IEEE Trans. Image Processing, Vol. 1, pp. 18–30, 1992.

    Google Scholar 

  2. Y. Fisher (Ed.), Fractal Image Compression—Theory and Application, Springer-Verlag: New York, 1994.

    Google Scholar 

  3. M. Barnsley, Fractals Everywhere, Academic Press: San Diego, 1988.

    Google Scholar 

  4. D. Saupe and R. Hamzaoui, “Complexity reduction methods for fractal image compression,” in Proc. I.M.A. Conf. Image Processing: Mathematical Methods and Applications, Sept. 1994, J.M. Blackledge (Ed.), Oxford University Press, 1997, pp. 211–229.

  5. H. Kaouri, “Fractal coding of still images,” in Proc. IEE 6th International Conference on Digital Processing of Signals in Communications, 1991, pp. 235–239.

  6. M. Nelson and J.-L. Gailly, The Data Compression Book, 2nd edition, M & T books: New York, 1995.

    Google Scholar 

  7. R. Hamzaoui, “Decoding algorithm for fractal image compression,” Electronics Letters,Vol. 32, No. 14, pp. 1273–1274, 1996.

    Google Scholar 

  8. R. Hamzaoui, “Fast decoding algorithms for fractal image compression,” in Proc. of the Conference Fractals in Engineering, Arcachon, June 1997.

  9. H.-S. Kang and S.-D. Kim, “Fractal decoding algorithm for fast convergence,” Optical Engineering, Vol. 35, No. 11, pp. 3191–3198, 1996.

    Google Scholar 

  10. Y. Fisher, “Fractal image compression with quadtrees,” in Fractal Image Compression—Theory and Application, Y. Fisher (Ed.), Springer-Verlag: New York, 1994.

    Google Scholar 

  11. L.M. Lundheim, “A discrete framework for fractal signal modelling,” in Fractal Image Compression—Theory and Application, Y. Fisher (Ed.), Springer-Verlag: New York, 1994.

    Google Scholar 

  12. R.S. Varga, Matrix Iterative Analysis, Prentice-Hall: Englewood Cliffs, NJ, 1962.

    Google Scholar 

  13. D.M. Young, Iterative Solution of Large Linear Systems, Academic Press: New York, 1971.

    Google Scholar 

  14. J. Stoer and R. Bulirsch, An Introduction to Numerical Analysis, Springer Verlag: New York, 1992.

    Google Scholar 

  15. D. Saupe, “The futility of square isometries in fractal image compression,” in Proc. ICIP-96 IEEE Int. Conf. on Image Processing, Lausanne, Sept. 1996, Vol. I, pp. 161–164.

    Google Scholar 

  16. N. Lu, Fractal Imaging, Academic Press, 1997.

  17. M. Ruhl, H. Hartenstein, and D. Saupe, “Adaptive partitionings for fractal image compression,” in Proc. ICIP-1997 IEEE International Conference on Image Processing, Santa Barbara, CA, Oct. 1997, Vol. II, pp. 310–313.

    Google Scholar 

  18. R. Barrett, M. Berry, T.F. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine, and H. van der Vorst, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, SIAM, Philadelphia, PA, 1994.

    Google Scholar 

  19. G.E. Øien and S. Lepsøy, “A class of fractal image coders with fast decoder convergence,” in Fractal Image Compression— Theory and Application, Y. Fisher (Ed.), Springer-Verlag: New York, 1994.

    Google Scholar 

  20. Z. Baharav, D. Malah, and E. Karnin, “Hierarchical interpretation of fractal image coding and its applications,” in Fractal Image Compression—Theory and Application, Y. Fisher (Ed.), Springer-Verlag: New York, 1994.

    Google Scholar 

  21. Y. Fisher and S. Menlove, “Fractal encoding with HV partitions,” in Fractal Image Compression—Theory and Application, Y. Fisher (Ed.), Springer-Verlag: New York, 1994.

    Google Scholar 

  22. R. Hamzaoui, “Ordered decoding algorithm for fractal image compression,” in Proc. PCS'97 Picture Coding Symposium, Berlin, Sept. 1997, pp. 91–95.

  23. B. Hürtgen and S.F. Simon, “On the problem of convergence in fractal coding schemes,” in Proc. ICIP-94 IEEE Int. Conf. Image Processing, Austin, Texas, 1994, Vol. 3, pp. 103–106.

    Google Scholar 

  24. J. Domaszewicz and V.A. Vaishampayan, “Graph-theoretical analysis of the fractal transform,” in Proc. ICASSP-1995 IEEE Int. Conf. Acoustics, Speech and Signal Processing, Detroit, 1995, Vol. 4, pp. 2559–2562.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hamzaoui, R. Fast Iterative Methods for Fractal Image Compression. Journal of Mathematical Imaging and Vision 11, 147–159 (1999). https://doi.org/10.1023/A:1008343530356

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008343530356

Navigation