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

An Improved Multithreshold Segmentation Algorithm Based on Graph Cuts Applicable for Irregular Image

Author

Listed:
  • Yanzhu Hu
  • Jiao Wang
  • Xinbo Ai
  • Xu Zhuang

Abstract

In order to realize the multithreshold segmentation of images, an improved segmentation algorithm based on graph cut theory using artificial bee colony is proposed. A new weight function based on gray level and the location of pixels is constructed in this paper to calculate the probability that each pixel belongs to the same region. On this basis, a new cost function is reconstructed that can use both square and nonsquare images. Then the optimal threshold of the image is obtained through searching for the minimum value of the cost function using artificial bee colony algorithm. In this paper, public dataset for segmentation and widely used images were measured separately. Experimental results show that the algorithm proposed in this paper can achieve larger Information Entropy (IE), higher Peak Signal to Noise Ratio (PSNR), higher Structural Similarity Index (SSIM), smaller Root Mean Squared Error (RMSE), and shorter time than other image segmentation algorithms.

Suggested Citation

  • Yanzhu Hu & Jiao Wang & Xinbo Ai & Xu Zhuang, 2019. "An Improved Multithreshold Segmentation Algorithm Based on Graph Cuts Applicable for Irregular Image," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-25, May.
    • Handle: RePEc:hin:jnlmpe:3514258
    DOI: 10.1155/2019/3514258
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/3514258.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2019/3514258.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2019/3514258?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:3514258. 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.