Ant Colony System for Image Segmentation Using Markov Random Field
暂无分享,去创建一个
Clustering is the process of partitioning a given set of pixels into a number of homogenous clusters based on a similarity criterion. The clustering problem is a difficult optimization problem for two main reasons: first the search space of the optimization is too large, second the clustering objective function is typically non convex and thus may exhibit a large number of local minima. In this paper we propose the use of the Ant Colony System (ACS) [1] to solve the clustering problem.
[1] Donald Geman,et al. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images , 1984 .
[2] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..