Abstract
We survey new methods in “Computational Fractal Geometry.” We start with M. Barnsley's pioneering Iterative Function Systems and our extension of this method, in particular Mutually Recursive Function Systems. Further we discuss (Probabilistic) Finite Generators, L-systems and other methods as used for image generations.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This research was supported by the National Sciences Foundation under Grant No. CCR-8702752.
Preview
Unable to display preview. Download preview PDF.
References
M.F.Barnsley, Fractals Everywhere, Academic Press, 1988.
M.F.Barnsley, R.L.Devaney, B.B.Mandelbrot, H-O.Peitgen, D.Saupe and R.S.Voss, The Science of Fractal Images, Springer-Verlag, 1988.
J. Berstel and A. Nait Abdallah, Quadtrees Generated by Finite Automata. AFCET 61–62, 167–175 (1989).
J.Berstel and M.Morcrette, Compact Representation of Pattern by Finite Automata, Res.Rep. 89–66, Institut de Programmation, Université Paris 7 (1989).
L. Boasson and M. Nivat, Adherences of Languages, JCSS 20, 285–309 (1980).
G.J. Chaitin, Algorithmic Information Theory, IBM Journal of Research and Development 21, 350–359 (1977).
K. Culik II and S. Dube, Affine Automata and Related Techniques for Generation of Complex Images, Technical Report TR 90009, Dept. of Computer Science, Univ. of S. Carolina. Preliminary version in Proc. of MFCS'1990. Lecture Notes in Computer Science 452, Springer-Verlag 1990, pp. 224–231.
K. Culik II and S. Dube, Rational and Affine Expressions for Image Synthesis. Preliminary version in Proc. of FST-TCS'1990. Lecture Notes in Computer Science 472, Springer-Verlag 1990, pp. 76–90. To appear in Discrete Applied Mathematics.
K. Culik II and S. Dube, Balancing Order and Chaos in Image Generation, Technical Report TR 9103, Dept. of Computer Science, Univ. of S. Carolina. Preliminary version to appear in the Proc. of ICALP'91, Madrid, Spain.
K. Culik II and S. Dube, Encoding Images as Words and Languages, Proc. of the International Colloquium on Words, Languages and Combinatorics, Kyoto Sangyo University, Japan, August 1990.
K. Culik II and J. Kari, Image Compression Using Weighted Finite Automata, manuscript.
K. Culik II and J. Kari, Finite Automata Computing Real Functions, manuscript.
F.M. Dekking, Recurrent Sets, Advances in Mathematics 44, 78–104 (1982).
S. Dube, Using Fractal Geometry for Analysis of Divide-and-Conquer Algorithms, manuscript.
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).
B. Mandelbrot, The Fractal Geometry of Nature, W. H. Freeman and Co., San Francisco, (1982).
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, pp.534–548, Springer-Verlag, Berlin, 1987. Lecture Notes in Computer Science 291.
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).
Not Just a Pretty Face: Compressing Pictures with Fractals. Scientific American, p. 77, March 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Culik, K., Dube, S. (1991). New methods for image generation and compression. In: Maurer, H. (eds) New Results and New Trends in Computer Science. Lecture Notes in Computer Science, vol 555. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0038183
Download citation
DOI: https://doi.org/10.1007/BFb0038183
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54869-0
Online ISBN: 978-3-540-46457-0
eBook Packages: Springer Book Archive