Premium
A comparison of stochastic optimization techniques for image segmentation
Author(s) -
Bhandarkar Suchendra M.,
Zhang Hui
Publication year - 2000
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/(sici)1098-111x(200005)15:5<441::aid-int4>3.0.co;2-r
Subject(s) - image segmentation , maxima and minima , artificial intelligence , computer science , segmentation , simulated annealing , scale space segmentation , grayscale , pattern recognition (psychology) , image (mathematics) , mathematics , algorithm , mathematical analysis
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 heterogenous. A segmented image is considered to be the highest domain‐independent abstraction of an input image. In this paper, the image segmentation problem is treated as one of combinatorial optimization. A cost function which incorporates both, edge information and region gray‐scale variances is defined. The cost function is shown to be multivariate with several local minima. Three stochastic optimization techniques, namely, simulated annealing (SA), microcanonical annealing (MCA), and the random cost algorithm (RCA) are investigated and compared in the context of minimization of the aforementioned cost function for image segmentation. Experimental results on gray‐scale images are presented. © 2000 John Wiley & Sons, Inc.