A comparison of nature inspired algorithms for multi-threshold image segmentation

Valentín Osuna-Enciso, Erik Cuevas, Humberto Sossa

Resultado de la investigación: Contribución a una revistaArtículo

95 Citas (Scopus)

Resumen

In the field of image analysis, segmentation is one of the most important preprocessing steps. One way to achieve segmentation is by mean of threshold selection, where each pixel that belongs to a determined class is labeled according to the selected threshold, giving as a result pixel groups that share visual characteristics in the image. Several methods have been proposed in order to solve threshold selection problems; in this work, it is used the method based on the mixture of Gaussian functions to approximate the 1D histogram of a gray level image and whose parameters are calculated using three nature inspired algorithms (Particle Swarm Optimization, Artificial Bee Colony Optimization and Differential Evolution). Each Gaussian function approximates the histogram, representing a pixel class and therefore a threshold point. Experimental results are shown, comparing in quantitative and qualitative fashion as well as the main advantages and drawbacks of each algorithm, applied to multi-threshold problem. © 2012 Elsevier Ltd. All rights reserved.
Idioma originalInglés estadounidense
Páginas (desde-hasta)1213-1219
Número de páginas1091
PublicaciónExpert Systems with Applications
DOI
EstadoPublicada - 1 mar 2013

Huella dactilar

Image segmentation
Pixels
Particle swarm optimization (PSO)
Image analysis

Citar esto

@article{85ecc86aa63842f6b4248c5d7384c6d2,
title = "A comparison of nature inspired algorithms for multi-threshold image segmentation",
abstract = "In the field of image analysis, segmentation is one of the most important preprocessing steps. One way to achieve segmentation is by mean of threshold selection, where each pixel that belongs to a determined class is labeled according to the selected threshold, giving as a result pixel groups that share visual characteristics in the image. Several methods have been proposed in order to solve threshold selection problems; in this work, it is used the method based on the mixture of Gaussian functions to approximate the 1D histogram of a gray level image and whose parameters are calculated using three nature inspired algorithms (Particle Swarm Optimization, Artificial Bee Colony Optimization and Differential Evolution). Each Gaussian function approximates the histogram, representing a pixel class and therefore a threshold point. Experimental results are shown, comparing in quantitative and qualitative fashion as well as the main advantages and drawbacks of each algorithm, applied to multi-threshold problem. {\circledC} 2012 Elsevier Ltd. All rights reserved.",
author = "Valent{\'i}n Osuna-Enciso and Erik Cuevas and Humberto Sossa",
year = "2013",
month = "3",
day = "1",
doi = "10.1016/j.eswa.2012.08.017",
language = "American English",
pages = "1213--1219",
journal = "Expert Systems with Applications",
issn = "0957-4174",
publisher = "Elsevier Ltd",

}

A comparison of nature inspired algorithms for multi-threshold image segmentation. / Osuna-Enciso, Valentín; Cuevas, Erik; Sossa, Humberto.

En: Expert Systems with Applications, 01.03.2013, p. 1213-1219.

Resultado de la investigación: Contribución a una revistaArtículo

TY - JOUR

T1 - A comparison of nature inspired algorithms for multi-threshold image segmentation

AU - Osuna-Enciso, Valentín

AU - Cuevas, Erik

AU - Sossa, Humberto

PY - 2013/3/1

Y1 - 2013/3/1

N2 - In the field of image analysis, segmentation is one of the most important preprocessing steps. One way to achieve segmentation is by mean of threshold selection, where each pixel that belongs to a determined class is labeled according to the selected threshold, giving as a result pixel groups that share visual characteristics in the image. Several methods have been proposed in order to solve threshold selection problems; in this work, it is used the method based on the mixture of Gaussian functions to approximate the 1D histogram of a gray level image and whose parameters are calculated using three nature inspired algorithms (Particle Swarm Optimization, Artificial Bee Colony Optimization and Differential Evolution). Each Gaussian function approximates the histogram, representing a pixel class and therefore a threshold point. Experimental results are shown, comparing in quantitative and qualitative fashion as well as the main advantages and drawbacks of each algorithm, applied to multi-threshold problem. © 2012 Elsevier Ltd. All rights reserved.

AB - In the field of image analysis, segmentation is one of the most important preprocessing steps. One way to achieve segmentation is by mean of threshold selection, where each pixel that belongs to a determined class is labeled according to the selected threshold, giving as a result pixel groups that share visual characteristics in the image. Several methods have been proposed in order to solve threshold selection problems; in this work, it is used the method based on the mixture of Gaussian functions to approximate the 1D histogram of a gray level image and whose parameters are calculated using three nature inspired algorithms (Particle Swarm Optimization, Artificial Bee Colony Optimization and Differential Evolution). Each Gaussian function approximates the histogram, representing a pixel class and therefore a threshold point. Experimental results are shown, comparing in quantitative and qualitative fashion as well as the main advantages and drawbacks of each algorithm, applied to multi-threshold problem. © 2012 Elsevier Ltd. All rights reserved.

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84870250648&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=84870250648&origin=inward

U2 - 10.1016/j.eswa.2012.08.017

DO - 10.1016/j.eswa.2012.08.017

M3 - Article

SP - 1213

EP - 1219

JO - Expert Systems with Applications

JF - Expert Systems with Applications

SN - 0957-4174

ER -