IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v11y2020i4p123-139.html
   My bibliography  Save this article

Modified Moth-Flame Optimization Algorithm-Based Multilevel Minimum Cross Entropy Thresholding for Image Segmentation

Author

Listed:
  • Abdul Kayom Md Khairuzzaman

    (National Institute of Technology, Silchar, India)

  • Saurabh Chaudhury

    (National Institute of Technology, Silchar, India)

Abstract

Multilevel thresholding is a widely used image segmentation technique. However, multilevel thresholding becomes more and more computationally expensive as the number of thresholds increase. Therefore, it is essential to incorporate some suitable optimization technique to make it practical. In this article, a modification is proposed to the Moth-Flame Optimization (MFO) algorithm and then it is applied to multilevel thresholding for image segmentation. Cross entropy is used as the objective function to select the optimal thresholds. A set of benchmark test images are used to evaluate the proposed technique. The Mean Structural SIMilarity (MSSIM) index is used to measure the quality of the segmented images. The results of the proposed technique are compared with the original MFO, PSO, BFO, and WOA. Experimental results and analysis suggest that the proposed technique outperforms other techniques in terms of segmentation quality images and stability. Moreover, computation time required for multilevel thresholding is also reduced to a manageable level.

Suggested Citation

  • Abdul Kayom Md Khairuzzaman & Saurabh Chaudhury, 2020. "Modified Moth-Flame Optimization Algorithm-Based Multilevel Minimum Cross Entropy Thresholding for Image Segmentation," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 11(4), pages 123-139, October.
    • Handle: RePEc:igg:jsir00:v:11:y:2020:i:4:p:123-139
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.2020100106
    Download Restriction: no
    ---><---

    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:igg:jsir00:v:11:y:2020:i:4:p:123-139. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.