A fast scheme for multilevel thresholding based on a modified bees algorithm

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

Image segmentation is one of the most important tasks in image processing and pattern recognition. One of the most efficient and popular techniques for image segmentation is image thresholding. Among several thresholding methods, Kapur's (maximum entropy (ME)) and Otsu's methods have been widely adopted for their simplicity and effectiveness. Although efficient in the case of bi-level thresholding, they are very computationally expensive when extended to multilevel thresholding because they employ an exhaustive search for the optimal thresholds. In this paper, a fast scheme based on a modified Bees Algorithm (BA) called the Patch-Levy-based Bees Algorithm (PLBA) is adopted to render Kapur's (ME) and Otsu's methods more practical; this is achieved by accelerating the search for the optimal thresholds in multilevel thresholding. The experimental results demonstrate that the proposed PLBA-based thresholding algorithms are able to converge to the optimal multiple thresholds much faster than their corresponding methods based on Basic BA. The experiments also show that the thresholding algorithms based on BA algorithms outperform corresponding state-of-the-art metaheuristic-based methods that employ Bacterial Foraging Optimization (BFO) and quantum mechanism (quantum-inspired algorithms) and perform better than the non-metaheuristic-based Two-Stage Multi-threshold Otsu method (TSMO) in terms of the segmented image quality. In addition, the results show the high degree of stability of the proposed PLBA-based algorithms.

Original languageEnglish
JournalKnowledge-Based Systems
DOIs
Publication statusAccepted/In press - 10 Jun 2015

Fingerprint

Image segmentation
Maximum entropy methods
Image quality
Pattern recognition
Image processing
Entropy
Experiments
Maximum entropy
Simplicity
Experiment
Metaheuristics

Keywords

  • Bees algorithm
  • Levy flight
  • Maximum entropy thresholding
  • Multilevel thresholding
  • Otsu thresholding
  • Patch environment

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence
  • Management Information Systems
  • Information Systems and Management

Cite this

@article{f4530faa22944269adda48439284d8cc,
title = "A fast scheme for multilevel thresholding based on a modified bees algorithm",
abstract = "Image segmentation is one of the most important tasks in image processing and pattern recognition. One of the most efficient and popular techniques for image segmentation is image thresholding. Among several thresholding methods, Kapur's (maximum entropy (ME)) and Otsu's methods have been widely adopted for their simplicity and effectiveness. Although efficient in the case of bi-level thresholding, they are very computationally expensive when extended to multilevel thresholding because they employ an exhaustive search for the optimal thresholds. In this paper, a fast scheme based on a modified Bees Algorithm (BA) called the Patch-Levy-based Bees Algorithm (PLBA) is adopted to render Kapur's (ME) and Otsu's methods more practical; this is achieved by accelerating the search for the optimal thresholds in multilevel thresholding. The experimental results demonstrate that the proposed PLBA-based thresholding algorithms are able to converge to the optimal multiple thresholds much faster than their corresponding methods based on Basic BA. The experiments also show that the thresholding algorithms based on BA algorithms outperform corresponding state-of-the-art metaheuristic-based methods that employ Bacterial Foraging Optimization (BFO) and quantum mechanism (quantum-inspired algorithms) and perform better than the non-metaheuristic-based Two-Stage Multi-threshold Otsu method (TSMO) in terms of the segmented image quality. In addition, the results show the high degree of stability of the proposed PLBA-based algorithms.",
keywords = "Bees algorithm, Levy flight, Maximum entropy thresholding, Multilevel thresholding, Otsu thresholding, Patch environment",
author = "Hussein, {Wasim A.} and Shahnorbanun Sahran and {Sheikh Abdullah}, {Siti Norul Huda}",
year = "2015",
month = "6",
day = "10",
doi = "10.1016/j.knosys.2016.03.010",
language = "English",
journal = "Knowledge-Based Systems",
issn = "0950-7051",
publisher = "Elsevier",

}

TY - JOUR

T1 - A fast scheme for multilevel thresholding based on a modified bees algorithm

AU - Hussein, Wasim A.

AU - Sahran, Shahnorbanun

AU - Sheikh Abdullah, Siti Norul Huda

PY - 2015/6/10

Y1 - 2015/6/10

N2 - Image segmentation is one of the most important tasks in image processing and pattern recognition. One of the most efficient and popular techniques for image segmentation is image thresholding. Among several thresholding methods, Kapur's (maximum entropy (ME)) and Otsu's methods have been widely adopted for their simplicity and effectiveness. Although efficient in the case of bi-level thresholding, they are very computationally expensive when extended to multilevel thresholding because they employ an exhaustive search for the optimal thresholds. In this paper, a fast scheme based on a modified Bees Algorithm (BA) called the Patch-Levy-based Bees Algorithm (PLBA) is adopted to render Kapur's (ME) and Otsu's methods more practical; this is achieved by accelerating the search for the optimal thresholds in multilevel thresholding. The experimental results demonstrate that the proposed PLBA-based thresholding algorithms are able to converge to the optimal multiple thresholds much faster than their corresponding methods based on Basic BA. The experiments also show that the thresholding algorithms based on BA algorithms outperform corresponding state-of-the-art metaheuristic-based methods that employ Bacterial Foraging Optimization (BFO) and quantum mechanism (quantum-inspired algorithms) and perform better than the non-metaheuristic-based Two-Stage Multi-threshold Otsu method (TSMO) in terms of the segmented image quality. In addition, the results show the high degree of stability of the proposed PLBA-based algorithms.

AB - Image segmentation is one of the most important tasks in image processing and pattern recognition. One of the most efficient and popular techniques for image segmentation is image thresholding. Among several thresholding methods, Kapur's (maximum entropy (ME)) and Otsu's methods have been widely adopted for their simplicity and effectiveness. Although efficient in the case of bi-level thresholding, they are very computationally expensive when extended to multilevel thresholding because they employ an exhaustive search for the optimal thresholds. In this paper, a fast scheme based on a modified Bees Algorithm (BA) called the Patch-Levy-based Bees Algorithm (PLBA) is adopted to render Kapur's (ME) and Otsu's methods more practical; this is achieved by accelerating the search for the optimal thresholds in multilevel thresholding. The experimental results demonstrate that the proposed PLBA-based thresholding algorithms are able to converge to the optimal multiple thresholds much faster than their corresponding methods based on Basic BA. The experiments also show that the thresholding algorithms based on BA algorithms outperform corresponding state-of-the-art metaheuristic-based methods that employ Bacterial Foraging Optimization (BFO) and quantum mechanism (quantum-inspired algorithms) and perform better than the non-metaheuristic-based Two-Stage Multi-threshold Otsu method (TSMO) in terms of the segmented image quality. In addition, the results show the high degree of stability of the proposed PLBA-based algorithms.

KW - Bees algorithm

KW - Levy flight

KW - Maximum entropy thresholding

KW - Multilevel thresholding

KW - Otsu thresholding

KW - Patch environment

UR - http://www.scopus.com/inward/record.url?scp=84978322305&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84978322305&partnerID=8YFLogxK

U2 - 10.1016/j.knosys.2016.03.010

DO - 10.1016/j.knosys.2016.03.010

M3 - Article

JO - Knowledge-Based Systems

JF - Knowledge-Based Systems

SN - 0950-7051

ER -