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

Size Projection Algorithm: Optimal Thresholding Value Selection for Image Segmentation of Electrical Impedance Tomography

Author

Listed:
  • Kun Li
  • Na Yang
  • Jian Wang
  • Yan Han
  • Peng-Fei Nie
  • Min Zhang

Abstract

Thresholding is an efficient step to extract quantitative information since the potential artefacts are often introduced by the point-spread effect of tomographic imaging. The thresholding value was previously selected only relying on engineering experience or histogram of tomographic image, which often presents a great challenge to determine an accurate thresholding value for various applications. As the tomographic image features often do not provide sufficient information to choose the best thresholding value, the information implicit in the measured boundary data is introduced into the thresholding process in this paper. A projection error, the relative difference between the computed boundary data of current segmentation and the measured boundary data, is proposed as a quantitative measure of such image segmentation quality. Then, a new multistep image segmentation process, called size projection algorithm (SPA), is proposed to automatically determine an optimal thresholding value by minimising the projection error. Results of simulation and experiment demonstrate the improved performance of the SPA-based tomographic image segmentation. An application of size projection algorithm for gas-water two-phase flow visualisation is also reported in this paper.

Suggested Citation

  • Kun Li & Na Yang & Jian Wang & Yan Han & Peng-Fei Nie & Min Zhang, 2019. "Size Projection Algorithm: Optimal Thresholding Value Selection for Image Segmentation of Electrical Impedance Tomography," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-11, October.
  • Handle: RePEc:hin:jnlmpe:1368010
    DOI: 10.1155/2019/1368010
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/1368010.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2019/1368010.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2019/1368010?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:1368010. 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.