Practical evaluation of efficient fitness functions for binary images

Authors:
Róbert Ványi
Affiliations:
Institute of Informatics, University of Szeged, Szeged, Hungary
Venue:
EC'05 Proceedings of the 3rd European conference on Applications of Evolutionary Computing
Year:
2005

Citing 5
Cited 0

Polar IFS+Parisian Genetic Programming=Efficient IFS Inverse Problem Solving

Genetic Programming and Evolvable Machines
Fractal Image Compression and Recurrent Iterated Function Systems

IEEE Computer Graphics and Applications
Efficiently Computable Fitness Functions for Binary Image Evolution

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Genetic L-System Programming

PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Evolving edge detectors with genetic programming

GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Genetic Programming can be used to evolve complex objects. One field, where GP may be used is image analysis. There are several works using evolutionary methods to process, analyze or classify images. All these procedures need an appropriate fitness function, that is a similarity measure. However, computing such measures usually needs a lot of computational time. To solve this problem, the notion of efficiently computable fitness functions was introduced, and their theory was already examined in detail. In contrast to that work, in this paper the practical aspects of these fitness functions are discussed.