Affine automata: A technique to generate complex images
In this paper, we introduce probabilistic affine automata (PAA) which are probabilistic finite generators having transitions labeled with affine transformations. It is shown that PAA are capable of generating highly complex images. Barnsley's IFS method to generate fractals is a special case of PAA when the automaton happens to have only a single state.
KeywordsContractive Mapping Affine Transformation Iterate Function System Complex Image Outgoing Transition
Unable to display preview. Download preview PDF.
- M. F. Barnsley, Fractals Everywhere, Academic Press, 1988.Google Scholar
- M. F. Barnsley, J. H. Elton and D. P. Hardin, “Recurrent Iterated Function Systems”, Constructive Approximation, 5 3–31 (1989).Google Scholar
- M. F. Barnsley, A. Jacquin, L. Reuter and A. D. Sloan, “Harnessing Chaos for Image Synthesis”, Computer Graphics, SIGGARPH 1988 Conference Proceedings.Google Scholar
- K. Culik and S. Dube, “Image Synthesis using Affine Automata”, Technical Report TR90004, Dept. of Computer Science, Univ. of S. Carolina.Google Scholar
- K. Culik and S. Dube, “Image Synthesis using Rational Expressions”, Technical Report TR90001, Dept. of Computer Science, Univ. of S. Carolina.Google Scholar
- 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.Google Scholar
- J.Gleick, Chaos-Making a New Science, Penguin Books, 1988.Google Scholar
- B. Mandelbrot, The Fractal Geometry of Nature, W. H. Freeman and Co., San Francisco, 1982.Google Scholar