IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/927591.html
   My bibliography  Save this article

A Comparative Study of Improved Artificial Bee Colony Algorithms Applied to Multilevel Image Thresholding

Author

Listed:
  • Kanjana Charansiriphaisan
  • Sirapat Chiewchanwattana
  • Khamron Sunat

Abstract

Multilevel thresholding is a highly useful tool for the application of image segmentation. Otsu’s method, a common exhaustive search for finding optimal thresholds, involves a high computational cost. There has been a lot of recent research into various meta-heuristic searches in the area of optimization research. This paper analyses and discusses using a family of artificial bee colony algorithms, namely, the standard ABC, ABC/best/1, ABC/best/2, IABC/best/1, IABC/rand/1, and CABC, and some particle swarm optimization-based algorithms for searching multilevel thresholding. The strategy for an onlooker bee to select an employee bee was modified to serve our purposes. The metric measures, which are used to compare the algorithms, are the maximum number of function calls, successful rate, and successful performance. The ranking was performed by Friedman ranks. The experimental results showed that IABC/best/1 outperformed the other techniques when all of them were applied to multilevel image thresholding. Furthermore, the experiments confirmed that IABC/best/1 is a simple, general, and high performance algorithm.

Suggested Citation

  • Kanjana Charansiriphaisan & Sirapat Chiewchanwattana & Khamron Sunat, 2013. "A Comparative Study of Improved Artificial Bee Colony Algorithms Applied to Multilevel Image Thresholding," Mathematical Problems in Engineering, Hindawi, vol. 2013, pages 1-17, December.
    • Handle: RePEc:hin:jnlmpe:927591
    DOI: 10.1155/2013/927591
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2013/927591.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2013/927591.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/927591?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:927591. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.