Image segmentation using evolutionary computation

  • Authors:
  • S. M. Bhandarkar;Hui Zhang

  • Affiliations:
  • Dept. of Comput. Sci., Georgia Univ., Athens, GA;-

  • Venue:
  • IEEE Transactions on Evolutionary Computation
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Image segmentation denotes a process by which a raw input image is partitioned into nonoverlapping regions such that each region is homogeneous and the union of any two adjacent regions is heterogeneous. A segmented image is considered to be the highest domain-independent abstraction of an input image. The image segmentation problem is treated as one of combinatorial optimization. A cost function which incorporates both edge information and region gray-scale uniformity is defined. The cost function is shown to be multivariate with several local minima. The genetic algorithm, a stochastic optimization technique based on evolutionary computation, is explored in the context of image segmentation. A class of hybrid evolutionary optimization algorithms based on a combination of the genetic algorithm and stochastic annealing algorithms such as simulated annealing, microcanonical annealing, and the random cost algorithm is shown to exhibit superior performance as compared with the canonical genetic algorithm. Experimental results on gray-scale images are presented