Genetic Algorithm to Set Active Contour

Active contours, very popular in image segmentation, suffer from delicate adjustments of many parameters. We propose to carry out these adjustments using genetic algorithm. Here an active contour is implemented using a greedy algorithm. Within this framework, two approaches are presented. A supervised approach which delivers a global set of parameters. In this case the greedy algorithm is involved in the evaluation function of the genetic algorithm. The second approach is unsupervised. It determines a local set of parameters. The genetic algorithm computes a set of parameters which minimizes the energy at each point in the neighborhood of the current point in the greedy algorithm try to move.

• Type: Conference
• Year: 2003
• Where: CAIP
• Authors: Jean-Jacques Rousselle, Nicole Vincent, Nicolas Verbeke
• Keywords: Active Contour, CAIP 2003, Genetic Algorithm, Greedy Algorithm