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

Recursive Algorithms of Maximum Entropy Thresholding on Circular Histogram

Author

Listed:
  • Guifeng Yang
  • Jiulun Fan
  • Dong Wang

Abstract

Circular histogram thresholding is a novel color image segmentation method, which makes full use of the hue component color information of the image, so that the desired target can be better separated from the background. Maximum entropy thresholding on circular histogram is one of the exist circular histogram thresholding methods. However, this method needs to search for a pair of optimal thresholds on the circular histogram of two-class thresholding in an exhaustive way, and its running time is even longer than that of the existing circular histogram thresholding based on the Otsu criteria, so the segmentation efficiency is extremely low, and the real-time application cannot be realized. In order to solve this problem, a recursive algorithm of maximum entropy thresholding on circular histogram is proposed. Moreover, the recursive algorithm is extended to the case of multiclass thresholding. A large number of experimental results show that the proposed recursive algorithms are more efficient than brute force and the existing circular histogram thresholding based on the Otsu criteria.

Suggested Citation

  • Guifeng Yang & Jiulun Fan & Dong Wang, 2021. "Recursive Algorithms of Maximum Entropy Thresholding on Circular Histogram," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-13, March.
    • Handle: RePEc:hin:jnlmpe:6653031
    DOI: 10.1155/2021/6653031
    as

    Download full text from publisher

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