Abstract
We survey recently developed methods for generating deterministic fractals that have the potential for compression of arbitrary (practical) images. They are the Iterative Function Systems developed by Barnsley, the probabilistic finite generators, and probabilistic mutually recursive systems that generalize both former methods. We briefly introduce the formal notion of an image both as a compact set (of black points) and as a measure on Borel sets (specifying greyness or colors). We describe the above mentioned systems for image generation, some mathematical properties and discuss the problem of image encoding.
This research was supported by the National Sciences Foundation under Grant No. CCR-8702752.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. F. Barnsley, Fractals Everywhere, Academic Press, 1988.
M. F. Barnsley, J. H. Elton and D. P. Hardin, “Recurrent Iterated Function Systems,” Constructive Approximation, 5 3–31 (1989).
M. F. Barnsley, A. Jacquin, L. Reuter and A. D. Sloan, “Harnessing Chaos for Image Synthesis,” Computer Graphics, SIGGARPH 1988 Conference Proceedings.
M. F. Barnsley, R. L. Devaney, B. B. Mandelbrot, H-O. Peitgen, De Saupe, and R. F. Voss, Science of Fractal Images, Springer-Verlag, 1988.
J. Berstel and M. Morcrette, “Compact Representation of Patterns by Finite Automata,” Proceedings Pixim'89, Paris, pp. 387–402.
L. Boasson and M. Nivat, “Adherences of Languages,” Jour. of Computer. Syst. Sci., 20, 285–309 (1980).
R. Cohen and A. Gold, “Theory of ω-languages,” Part I and II, Jour. of Computer Syst. Sc., 15, 169–208 (1977).
K. Culik and S. Dube, “Image Synthesis using Affine Automata,” Technical Report TR90004, Dept. of Computer Science, Univ. of S. Carolina.
K. Culik and S. Dube, “Image Synthesis using Rational Expressions,” Technical Report TR90001, Dept. of Computer Science, Univ. of S. Carolina.
K. Culik and S. Dube, “L-systems and IFS”, under preparation.
K. Culik and S. Yu, “Cellular Automata, ωω-Regular Sets, and Sofic Systems,” to appear in Discrete Applied Mathematics.
F. M. Dekking, “Recurrent Sets,” Advances in Mathematics, 44, 78–104 (1982).
F. M. Dekking, “Recurrent Sets: A Fractal Formalism,” Report 82-32, Delft University of Technology, 1982.
D. B. Ellis and M. G. Branton, “Non-Self-Similar Attractors of Hyberbolic IFS,” in: J. C. Alexander (Ed.), Dynamical Systems, Lecture Notes in Mathematics 1342, pp. 158–171, Springer-Verlag, 1988.
S. Even, “Rational Numbers and Regular Events,” IEEE Transactions on Electronic Computers, EC-13, No. 6, 740–741 (1964).
J. Gleick, Chaos-Making a New Science, Penguin Books, 1988.
J. Hartmanis and R. E. Stearns, “Sets of Numbers Defined By Finite Automata,” American Mathematical Monthly, 74 539–542 (1967).
G. M. Hunter and K. Steiglitz, “Operations on Images Using Quadtrees,” IEEE Trans. on Pattern Analysis and Machine Intell., 1 145–153 (1979).
B. Mandelbrot, The Fractal Geometry of Nature, W. H. Freeman and Co., San Francisco, 1982.
Y. Liu, “Recurrent IFS, ω-orbit Finite Automata, and Regular Set Plotter,” M.S. Thesis, Dept. of Comp. Sci., Univ. of S. Carolina, 1990.
P. Prusinkiewicz, “Applications of L-systems to Computer Imagery,” in H. Ehrig, M. Nagl, A. Rosenfeld, and G. Rozenberg, editors, Graph grammars and their application to computer science; Third International Workshop, pages 534–548, Springer-Verlag, Berlin, 1987. Lecture Notes in Computer Science 291.
P. Prusinkiewicz, “Graphical Applications of L-systems,” Proceedings of Graphics Interface'86—Vision Interface'86, 247–253 (1986).
A. R. Smith, “Plants, Fractals, and Formal Languages,” Computer Graphics, 18, 1–10 (1984).
L. Staiger, “Quadtrees and the Hausdorff Dimension of Pictures,” Workshop on Geometrical Problems of Image Processing, Georgenthal GDR, 173–178 (1989).
W. G. Tzeng, “The Equivalence and Learning of Probabilistic Automata,” FOCS proceedings, 268–273 (1989).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Culik, K., Dube, S. (1990). Methods for generating deterministic fractals and image compression. In: Dassow, J., Kelemen, J. (eds) Aspects and Prospects of Theoretical Computer Science. IMYCS 1990. Lecture Notes in Computer Science, vol 464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53414-8_27
Download citation
DOI: https://doi.org/10.1007/3-540-53414-8_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53414-3
Online ISBN: 978-3-540-46869-1
eBook Packages: Springer Book Archive