A Novel Approach for Bi-Level Segmentation of Tuberculosis Bacilli Based on Meta-Heuristic Algorithms
Image thresholding is the most crucial step in microscopic image analysis to distinguish bacilli objects causing of tuberculosis disease. Therefore, several bi-level thresholding algorithms are widely used to increase the bacilli segmentation accuracy. However, bi-level microscopic image threshold...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Stefan cel Mare University of Suceava
2018-02-01
|
Series: | Advances in Electrical and Computer Engineering |
Subjects: | |
Online Access: | http://dx.doi.org/10.4316/AECE.2018.01014 |
Summary: | Image thresholding is the most crucial step in microscopic image analysis to distinguish bacilli objects
causing of tuberculosis disease. Therefore, several bi-level thresholding algorithms are widely used
to increase the bacilli segmentation accuracy. However, bi-level microscopic image thresholding problem
has not been solved using optimization algorithms. This paper introduces a novel approach for the
segmentation problem using heuristic algorithms and presents visual and quantitative comparisons
of heuristic and state-of-art thresholding algorithms. In this study, well-known heuristic algorithms
such as Firefly Algorithm, Particle Swarm Optimization, Cuckoo Search, Flower Pollination are used to
solve bi-level microscopic image thresholding problem, and the results are compared with the
state-of-art thresholding algorithms such as K-Means, Fuzzy C-Means, Fast Marching. Kapur's
entropy is chosen as the entropy measure to be maximized. Experiments are performed to make
comparisons in terms of evaluation metrics and execution time. The quantitative results are
calculated based on ground truth segmentation. According to the visual results, heuristic
algorithms have better performance and the quantitative results are in accord with the visual
results. Furthermore, experimental time comparisons show the superiority and effectiveness of
the heuristic algorithms over traditional thresholding algorithms. |
---|---|
ISSN: | 1582-7445 1844-7600 |