Sarafopoulos, A., 1999. Automatic generation of affine IFS and strongly typed genetic programming. In: Proceedings of the Genetic Programming: Second European Workshop, EuroGP'99, Göteborg, Sweden, May 1999. Berlin: Springer-Verlag, p. 651.
Full text not available from this repository.
Official URL: http://www.springerlink.com/content/ft1g2u74ha3mc2...
Abstract
Iterated Function Systems (IFS) are recursive systems that have applications in modeling, animation and, Fractal Image Compression. IFS can be represented as arrays of floating point constants or, as shown in this paper, hierarchical data structures and therefore are good candidates for evolutionary applications. This paper describes a Strongly Typed Genetic Programming (STGP) approach to the automatic generation and evolution of 2D affine IFS, and affine maps in general. We explain the nature of the encoding used in conjunction with STGP, and demonstrate with examples its application to the inverse problem for IFS.
| Item Type: | Book Section |
|---|---|
| Series Name: | Lecture Notes in Computer Science |
| Volume: | 1598 |
| Series Name: | Lecture Notes in Computer Science |
| Subjects: | Arts > Graphic Arts Generalities > Computer Science and Informatics |
| Group: | Media School > National Centre for Computer Animation Media School |
| ID Code: | 3556 |
| Deposited By: | INVALID USER |
| Deposited On: | 31 May 2007 |
| Last Modified: | 07 Mar 2013 14:40 |
| Repository Staff Only - | |
| BU Staff Only - | |
| Help Guide - | Editing Your Items in BURO |

Tools
Tools