Use of ant colony optimization for finding neighborhoods in image non-stationary Markov random field classification

  • Authors:
  • Sylvie Le Hégarat-Mascle;Abdelaziz Kallel;Xavier Descombes

  • Affiliations:
  • IEF/AXIS, Université de Paris-Sud, Orsay Cedex, France;CETP/IPSL, Vélizy, France;CNRS/INRIA/UNSA, INRIA, Sophia Antipolis, Cedex, France

  • Venue:
  • PReMI'07 Proceedings of the 2nd international conference on Pattern recognition and machine intelligence
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In global classifications using Markov Random Field (MRF) modeling, the neighborhood form is generally considered as independent of its location in the image. Such an approach may lead to classification errors for pixels located at the segment borders. The solution proposed here consists in relaxing the assumption of fixed-form neighborhood. Here we propose to use the Ant Colony Optimization (ACO) and to exploit its ability of self-organization. Modeling upon the behavior of social insects for computing strategies, the ACO ants collect information through the image, from one pixel to the others. The choice of the path is a function of the pixel label, favoring paths within a same image segment. We show that this corresponds to an automatic adaptation of the neighborhood to the segment form. Performance of this new approach is illustrated on a simulated image and on actual remote sensing images SPOT4/HRV.