The reviewed record of science sign in
Pith

arxiv: 1405.7229 · v1 · pith:LOJR6TYJ · submitted 2014-05-28 · cs.CV · cs.NE

A Multi-threshold Segmentation Approach Based on Artificial Bee Colony Optimization

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:LOJR6TYJrecord.jsonopen to challenge →

classification cs.CV cs.NE
keywords algorithmthresholdalgorithmsapproachartificialcolonycomplexgaussian
0
0 comments X
read the original abstract

This paper explores the use of the Artificial Bee Colony (ABC) algorithm to compute threshold selection for image segmentation. ABC is a heuristic algorithm motivated by the intelligent behavior of honey-bees which has been successfully employed to solve complex optimization problems. In this approach, an image 1D histogram is approximated through a Gaussian mixture model whose parameters are calculated by the ABC algorithm. For the approximation scheme, each Gaussian function represents a pixel class and therefore a threshold. Unlike the Expectation Maximization (EM) algorithm, the ABC based method shows fast convergence and low sensitivity to initial conditions. Remarkably, it also improves complex time consuming computations commonly required by gradient-based methods. Experimental results demonstrate the algorithms ability to perform automatic multi threshold selection yet showing interesting advantages by comparison to other well known algorithms.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.