Polar IFS + Parisian GP = Efficient IFS inverse problem solving - Archive ouverte HAL Access content directly
Journal Articles Genetic Programming and Evolvable Machines Year : 2000

Polar IFS + Parisian GP = Efficient IFS inverse problem solving

(1) , (1) , (1) , (2)
1
2

Abstract

The inverse problem for Iterated Functions Systems (finding an IFS whose attractor is a target 2D shape) with non-affine IFS is a very complex task. Successful approaches have been made using Genetic Programming, but there is still room for improvement in both the IFS and the GP parts. This paper introduces Polar IFS: a specific representation of IFS functions which shrinks the search space to mostly contractive functions and gives direct access to the fixed points of the functions. On the evolutionary side, the ``Parisian'' approach is presented. It is similar to the ``Michigan'' approach of Classifier Systems: each individual of the population only represents a part of the global solution. The solution to the inverse problem for IFS is then built from a set of individuals. Both improvements show a drastic cut-down on CPU-time: good results are obtained with small populations in few generations.
Fichier principal
Vignette du fichier
gpem2000.pdf (651.32 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00000097 , version 1 (31-10-2005)

Identifiers

  • HAL Id : inria-00000097 , version 1

Cite

Pierre Collet, Evelyne Lutton, Frédéric Raynal, Marc Schoenauer. Polar IFS + Parisian GP = Efficient IFS inverse problem solving. Genetic Programming and Evolvable Machines, 2000, 1 (4), pp.339-361. ⟨inria-00000097⟩
119 View
180 Download

Share

Gmail Facebook Twitter LinkedIn More