12.07.2015 Views

III WVC 2007 - Iris.sel.eesc.sc.usp.br - USP

III WVC 2007 - Iris.sel.eesc.sc.usp.br - USP

III WVC 2007 - Iris.sel.eesc.sc.usp.br - USP

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

<strong>WVC</strong>'<strong>2007</strong> - <strong>III</strong> Workshop de Visão Computacional, 22 a 24 de Outu<strong>br</strong>o de <strong>2007</strong>, São José do Rio Preto, SP.1 IntroductionMorphological image processing is a nonlinear <strong>br</strong>anch in image processing developedby Matheron and Serra in the 1960´s, based on geometry and the mathematical theory oforder [1 - 2]. Morphological image processing has proved to be a powerful tool for binaryand gray<strong>sc</strong>ale image computer vision processing tasks, such as edge detection,noise suppression, skeletonization, segmentation, pattern recognition and enhancement.The design of morphological procedures is not a trivial task in practice. It is necessarysome expert knowledge to properly <strong>sel</strong>ect the structuring element and the morphologicaloperators to solve a certain problem. In the literature there are several approachesusing automatic programming to overcome these difficulties [3 – 4], however,they present several drawbacks as a limited number of operators, only regular forms ofstructuring elements, only morphological instructions, to name just a few.Genetic programming (GP) is the most popular technique for automatic programmingnowadays and may provide a better context for the automatic generation of morphologicalprocedures [5]. GP is a <strong>br</strong>anch of evolutionary computation and artificial intelligence,based on concepts of genetics and Darwin’s principle of natural <strong>sel</strong>ection to genetically<strong>br</strong>eed and evolve computer programs to solve problems.Genetic Programming is the extension of the genetic algorithms [6] into the space ofprograms. That is, the objects that constitute the population are not fixed-length characterstrings that encode possible solutions to a certain problem. They are programs (expressedas parse trees) that are the candidate solutions to the problem. For example, thesimple program “min(x*2,x+2*y)” is illustrated in figure 1. The programs in the populationare elements from the function set and the terminal set, which will represent thesolution of problems in the domain of interest. In GP, the crossover operator is implementedby taking randomly <strong>sel</strong>ected subtrees in the individuals (<strong>sel</strong>ected according tofitness) and exchanging them.Figure 1. Parse Tree for “min(x*2,x+2*y)”.There are few applications of GP for the automatic construction of morphological operatorsin the literature [7]. We developed a linear genetic programming approach forthe automatic construction of morphological and logical operators, generating a toolboxnamed morph_gen for the Matlab program. The developed toolbox can be used for thedesign of non linear filters, image segmentation and pattern recognition of binary im-181

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!