This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fractal Image Compression and Recurrent Iterated Function Systems
July 1996 (vol. 16 no. 4)
pp. 25-33
ASCII Text
x 
 
John C. Hart, "Fractal Image Compression and Recurrent Iterated Function Systems," IEEE Computer Graphics and Applications, vol. 16, no. 4, pp. 25-33, July, 1996.
 
 
BibTex
x
 
@article{ 10.1109/38.511849,
author = {John C. Hart},
title = {Fractal Image Compression and Recurrent Iterated Function Systems},
journal ={IEEE Computer Graphics and Applications},
volume = {16},
number = {4},
issn = {0272-1716},
year = {1996},
pages = {25-33},
doi = {http://doi.ieeecomputersociety.org/10.1109/38.511849},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - MGZN
JO - IEEE Computer Graphics and Applications
TI - Fractal Image Compression and Recurrent Iterated Function Systems
IS - 4
SN - 0272-1716
SP25
EP33
EPD - 25-33
A1 - John C. Hart,
PY - 1996
KW - Bitmap
KW - fractal image compression
KW - inverse problem
KW - recurrent iterated function system.
VL - 16
JA - IEEE Computer Graphics and Applications
ER -
 
When every domain element can be expressed as the union of range elements, fractal image compression produces a structure equivalent to a recurrent iterated function system. This equivalence broadens the scope of the recurrent iterated function system, enabling it to represent arbitrary shapes. The RIFS representation encodes bitmaps better than standard fractal image compression, and supports further processing such as edge detection and escape time visualization.

1. P. Prusinkiewicz and A. Lindenmayer, The Algorithmic Beauty of Plants, Springer-Verlag, New York, 1990.
2. P. Prusinkiewicz and M. Hammel, "Language Restricted Iterated Function Systems, Koch Constructions and L-Systems," in New Directions for Fractal Modeling in Computer Graphics, J.C. Hart, ed., Siggraph Course Notes, ACM, New York, July 1994, pp. 4-1-4-14.
3. J. Hart, "The Object Instancing Paradigm for Linear Fractal Modeling," Proc. Graphics Interface 92, Morgan Kaufmann, San Francisco, 1992, pp. 224-231.
4. Y. Fisher, Fractal Image Compression: Theory and Application. Springer-Verlag, 1995.
5. M. Barnsley and P. Hurd, Fractal Image Compression, AK Peters, Wellesley, Mass., 1992.
6. J. Hutchinson, "Fractals and Self-Similarity," Indiana Univ. Math. J., Vol. 30, No. 5, 1981, pp. 713-747.
7. M.F. Barnsley, J.H. Elton, and D.P. Hardin, "Recurrent Iterated Function Systems," Constructive Approximation, Vol. 5, 1989, pp. 3-31.
8. M.F. Barnsley, Fractals Everywhere, Academic Press, San Diego, Calif., 1988.
9. H.-O. Peitgen, H. Jurgens, and D. Saupe, Chaos and Fractals, Springer-Verlag, New York, 1994.
10. D. Saupe and R. Hamzaoui, "A Review of the Fractal Image Compression Literature," Computer Graphics, Vol. 28, No. 4, Nov. 1994, pp. 268-276.
11. A.E. Jacquin, "Image Coding Based on a Fractal Theory of Iterated Contractive Image Transformations," IEEE Trans. Image Processing, Vol. 1, No. 1, Jan. 1992, pp. 18-30.
12. J. Evans, ed., The Natural Science Picture Sourcebook: 500 Copyright-Free Illustrations of Unusual Animals and Plants for Copying and Reference, Van Nostrand Reinhold, 1984.
13. W.A. Bentley and W.J. Humphreys, Snow Crystals,Dover, 1962.
14. P. Prusinkiewicz and M.S. Hammel, "Escape-Time Visualization Method for Language-Restricted Iterated Function Systems," in Proc. of Graphics Interface, Morgan Kaufmann, Palo Alto, 1992, pp. 213-223.
15. D.H. Hepting and J.C. Hart, "The Escape Buffer: Efficient Computation of Escape Time for Linear Fractals," in Proc. of Graphics Interface 95, May 1995, pp. 204-214.

Index Terms:
Bitmap, fractal image compression, inverse problem, recurrent iterated function system.
Citation:
John C. Hart, "Fractal Image Compression and Recurrent Iterated Function Systems," IEEE Computer Graphics and Applications, vol. 16, no. 4, pp. 25-33, July 1996, doi:10.1109/38.511849
Usage of this product signifies your acceptance of the Terms of Use.