Use of ant colony optimization for finding neighborhoods in image non-stationary Markov Random Field classification

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Le Hégarat-Mascle, S., Kallel, A., & Descombes, X. (2007). Use of ant colony optimization for finding neighborhoods in image non-stationary Markov Random Field classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4815 LNCS, pp. 279–286). Springer Verlag. https://doi.org/10.1007/978-3-540-77046-6_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free