The Estimation of Hölderian Regularity using Genetic Programming

Published in Conferences Papers
  1. Leonardo Trujillo, Pierrick Legrand and Jacques Lévy Véhel. The estimation of hölderian regularity using genetic programming. In GECCO. 2010, 861-868. BibTeX

    @inproceedings{DBLP:conf/gecco/TrujilloLV10,
    	author = "Leonardo Trujillo and Pierrick Legrand and Jacques L{\'e}vy V{\'e}hel",
    	title = {The estimation of h{\"o}lderian regularity using genetic programming},
    	booktitle = "GECCO",
    	year = 2010,
    	pages = "861-868",
    	ee = "http://doi.acm.org/10.1145/1830483.1830641",
    	crossref = "DBLP:conf/gecco/2010",
    	bibsource = "DBLP, http://dblp.uni-trier.de"
    }
    
  2. Martin Pelikan and Jürgen Branke (eds.). Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7-11, 2010. ACM, 2010. BibTeX

    @proceedings{DBLP:conf/gecco/2010,
    	editor = {Martin Pelikan and J{\"u}rgen Branke},
    	title = "Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings, Portland, Oregon, USA, July 7-11, 2010",
    	booktitle = "GECCO",
    	publisher = "ACM",
    	year = 2010,
    	isbn = "978-1-4503-0072-5",
    	bibsource = "DBLP, http://dblp.uni-trier.de"
    }
    
Abstract

This paper presents a Genetic Programming (GP) approach to synthesize estimators for the pointwise Hölder exponent in 2D signals. It is known that irregularities and singularities are the most salient and informative parts of a signal. Hence, explicitly measuring these variations can be important in various domains of signal processing. The pointwise Hölder exponent provides a characterization of these types of features. However, current methods for estimation cannot be considered to be optimal in any sense. Therefore, the goal of this work is to automatically synthesize operators that provide an estimation for the Hölderian regularity in a 2D signal. This goal is posed as an optimization problem in which we attempt to minimize the error between a prescribed regularity and the estimated regularity given by an image operator. The search for optimal estimators is then carried out using a GP algorithm. Experiments confirm that the GP-operators produce a good estimation of the Hölder exponent in images of multifractional Brownian motions. In fact, the evolved estimators significantly outperform a traditional method by as much as one order of magnitude. These results provide further empirical evidence that GP can solve difficult problems of applied mathematics.

Published in
GECCO '10 Proceedings of the 12th annual conference on Genetic and evolutionary computation
Pages 861-868
http://dl.acm.org/citation.cfm?id=1830483.1830641
Date of conference
07 - 11 July 2010
ISBN
978-1-4503-0072-8
Feedback