On two approaches to image processing algorithm design for binary images using GP

  • Authors:
  • Marcos I. Quintana;Riccardo Poli;Ela Claridge

  • Affiliations:
  • School of Computer Science, University of Birmingham, Birmingham, UK;Department of Computer Science, University of Essex, Colchester, UK;School of Computer Science, University of Birmingham, Birmingham, UK

  • Venue:
  • EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we describe and compare two different approaches to design image processing algorithms for binary images using Genetic Programming (GP). The first approach is based on the use of mathematical morphology primitives. The second is based on Sub-Machine-Code GP: a technique to speed up and extend GP based on the idea of exploiting the internal parallelism of sequential CPUs. In both cases the objective is to find programs which can transform binary images of a certain kind into other binary images containing just a particular characteristic of interest. In particular, here we focus on the extraction of three different features in music sheets.