Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Use of Ant Colony Optimization for Finding Neighborhoods in Image Non-stationary Markov Random Field Classification
| |
|
Use of Ant Colony Optimization for Finding Neighborhoods in Image Non-stationary Markov Random Field Classification
Sylvie Le Hégarat-Mascle1, Abdelaziz Kallel2 and Xavier Descombes3
| (1) |
IEF/AXIS, Université de Paris-Sud 91405, Orsay Cedex, France |
| (2) |
CETP/IPSL, 10, 12 avenue de l’Europe 78140, Vélizy, France |
| (3) |
CNRS/INRIA/UNSA, INRIA, 06902 Sophia Antipolis, Cedex, France |
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.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|