Automatic generation of affine IFS and strongly typed genetic programming
Authors: Sarafopoulos, A.
Volume: 1598
Pages: 149-160
ISBN: 9783540658993
DOI: 10.1007/3-540-48885-5_12
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.
Source: Scopus
Automatic generation of affine IFS and Strongly Typed Genetic Programming
Authors: Sarafopoulos, A.
Volume: 1598
Pages: 149-160
Source: Web of Science (Lite)
Automatic generation of affine IFS and strongly typed genetic programming
Authors: Sarafopoulos, A.
Volume: 1598
Pages: 651
Publisher: Springer-Verlag
Place of Publication: Berlin
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.
http://www.springerlink.com/content/ft1g2u74ha3mc2uk/?p=c41523c6a70543dbb8118166fcafa26d&pi=0
Source: Manual
Preferred by: Ari Sarafopoulos