Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M. Dorigo, and L. Gambardella. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem, IEEE Transactions on Evolutionary Computation 1(1): 53–66, 1997.
S. Geman. and D. Geman. Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images, IEEE Transactions on Pattern Analysis and Machine Intelligence 6(6): 721–741, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ouadfel, S., Batouche, M., Garbay, C. (2002). Ant Colony System for Image Segmentation Using Markov Random Field. In: Dorigo, M., Di Caro, G., Sampels, M. (eds) Ant Algorithms. ANTS 2002. Lecture Notes in Computer Science, vol 2463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45724-0_32
Download citation
DOI: https://doi.org/10.1007/3-540-45724-0_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44146-5
Online ISBN: 978-3-540-45724-4
eBook Packages: Springer Book Archive