IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v2y2017i1idhcseit172133.html

Brain Tumor Image Segmentation using K-means Clustering Algorithm

Author

Listed:
  • Kanchana Devi E
  • D. Devi Aruna

Abstract

Brain tumor segmentation aims to separate the different tumor tissues such as active cells, necrotic core, and edema from normal brain tissues of White Matter (WM), Gray Matter (GM), and Cerebrospinal Fluid (CSF). MRI based brain tumor segmentation studies are attracting more and more attention in recent years due to non-invasive imaging and good soft tissue contrast of Magnetic Resonance Imaging (MRI) images. With the development of almost two decades, the innovative approaches applying computer-aided techniques for segmenting brain tumor are becoming more and more mature and coming closer to routine clinical applications. The purpose of this paper is to provide a K-means clustering algorithm for MRI-based brain tumor segmentation. K-means clustering algorithm is an unsupervised algorithm and it is used to segment the interest area from the background. However, before applying K-means algorithm, first partial stretching enhancement is applied to the image to improve the quality of the image.

Suggested Citation

  • Kanchana Devi E & D. Devi Aruna, 2017. "Brain Tumor Image Segmentation using K-means Clustering Algorithm," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 2(1), pages 209-214, February.
  • Handle: RePEc:jbh:ijsrcs:v2:y2017:i1:id:hcseit172133
    Note: Article URL: https://ijsrcseit.com/CSEIT172133
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT172133
    File Function: Article URL
    Download Restriction: no

    File URL: https://ijsrcseit.com/paper/CSEIT172133.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:jbh:ijsrcs:v2:y2017:i1:id:hcseit172133. 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: Pankaj Sharma (email available below). General contact details of provider: https://ijsrcseit.com/home .

    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.