Advertisement

Unsupervised Image Segmentation Using a Colony of Cooperating Ants

  • Salima Ouadfel
  • Mohamed Batouche
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2525)

Abstract

In this paper, we present a novel method for unsupervised image segmentation. Image segmentation is cast as a clustering problem, which aims to partition 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. Ant Colony Optimization is a recent multi-agent approach based on artificial ants for solving hard combinatorial optimization problems. We propose the use of the Max-Min Ant System (MMAS) to solve the clustering problem in the field of image segmentation. Each pixel within the image is mapped to its closest cluster taking into account its immediate neighborhood. The obtained results are encouraging and prove the feasibility of the proposed algorithm.

Keywords

Image Segmentation Clustering Ant Colony Optimization Max-Min Ant System 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A.k. Jain, M. Murty and P. Flynn. ≪Data Clustering, A Review≫. ACM Computing Survey. Vol. 31, N° 3. 1999.Google Scholar
  2. [2]
    M. Dorigo, V. Maniezzo. and A. Colorni. ≪ The Ant System: Optimization by a Colony of Cooperating Agents ≫. IEEE Transactions on Systems, Man and Cybernetics-Part B, Vol. 26, N° 1, pp: 29–41. 1996.CrossRefGoogle Scholar
  3. [3]
    M. Dorigo, and L. Gambardella. ≪Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. ≫. IEEE Transactions on Evolutionary Computation 1, pp: 53–66, 1997.CrossRefGoogle Scholar
  4. [4]
    M. Dorigo, G. Di Caro, and L. Gambardella. ≪ Ant Algorithms for Discrete Optimization ≫. Artificial Life. Vol. 5, N°2, pp: 137–172. 1999.CrossRefGoogle Scholar
  5. [5]
    P. Andrey and P. Tarroux. ≪ Unsupervised image segmentation using a distributed genetic algorithm≫. Patt. Recogn., Vol. 27, N°5, pp: 659–673, 1994.CrossRefGoogle Scholar
  6. [6]
    S. Laskshmanan and H. Derin. ≪Simultaneous segmentation pg Gibbs Random Field using Simulated Annealing. ≫ IEEE Trans. On Pattern Analysis and Machine Intelligence. Vol. 11, N°8, pp: 799–813, 1989.CrossRefGoogle Scholar
  7. [7]
    T. Stutzle and H. Hoos. ≪ Improvement on Ant System: Introducing the MAX-MIN Ant System≫. In the proceeding of the International Conference on Artificial Neural Networks and Genetic Algorithms, pp: 245–249. Springer-Verlag, Wien, 1997.Google Scholar
  8. [8]
    T. Stutzle and H. Hoos. ≪ MAX-MIN Ant System and Local Search for Combinatorial Optimization Problems. Towards Adaptive Tools for Combinatorial Global Optimization≫. 2nd Metaheuristics International Conference, Sophia-Antipolis, France.1997.Google Scholar
  9. [9]
    Z. Selim and A. Ismail. ≪ K-Means-Type Algorithm: Generalized convergence theorem and characterization of local optimality≫. IEEE. Trans. Anal. Mach. Intell. Vol. 6, pp: 81–87, 1984.CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Salima Ouadfel
    • 1
    • 2
  • Mohamed Batouche
    • 2
  1. 1.Département InformatiqueUniversité de BatnaAlgérie
  2. 2.Equipe Vision et Infographie, Laboratoire LIREUniversité de ConstantineAlgérie

Personalised recommendations