Automatic generation of affine IFS and strongly typed genetic programming

This source preferred by Ari Sarafopoulos

Authors: Sarafopoulos, A.

http://www.springerlink.com/content/ft1g2u74ha3mc2uk/?p=c41523c6a70543dbb8118166fcafa26d&pi=0

Volume: 1598

Pages: 651

Publisher: Springer-Verlag

Place of Publication: Berlin

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.

This data was imported from Scopus:

Authors: Sarafopoulos, A.

Volume: 1598

Pages: 149-160

ISBN: 9783540658993

© Springer-Verlag Berlin Heidelberg 1999. 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.

This data was imported from Web of Science (Lite):

Authors: Sarafopoulos, A.

Volume: 1598

Pages: 149-160

The data on this page was last updated at 05:09 on February 27, 2020.