MRI-based brain tumor segmentation using Gaussian mixture model with reversible jump Markov chain Monte Carlo algorithm

Anindya Apriliyanti Pravitasari, Yusuf Puji Hermanto, Nur Iriawan, Irhamah, K. Fithriasari, S. W. Purnami, Widiana Ferriastuti
{"title":"MRI-based brain tumor segmentation using Gaussian mixture model with reversible jump Markov chain Monte Carlo algorithm","authors":"Anindya Apriliyanti Pravitasari, Yusuf Puji Hermanto, Nur Iriawan, Irhamah, K. Fithriasari, S. W. Purnami, Widiana Ferriastuti","doi":"10.1063/1.5139817","DOIUrl":null,"url":null,"abstract":"A brain tumor is the 15th deadly disease in Indonesia according to the WHO in 2018. In medical treatment, brain tumors can be detected through Magnetic Resonance Imaging (MRI). The main problem is how to separate the brain tumor area as the Region of interest (ROI) with the other healthy part (Non-ROI) in the MRI. In the computational statistics, a method used in image segmentation is cluster analysis. Model-Based Clustering with Gaussian Mixture Model (GMM) is often used to find the cluster where the tumor is placed. The EM Algorithm and Bayesian coupled with Markov chain Monte Carlo (MCMC) could be used to optimize the GMM. However, both EM and Bayesian MCMC are assumed that the number of clusters is fixed. Therefore, to select the optimum number of clusters, we have to use certain cluster selection criteria. This process makes the segmentation quite complicated and is not automatic. This study tries to employ the GMM using Reversible Jump Markov Chain Monte Carlo Algorithm (GMM-RJMCMC) to segment the MRI-based brain tumor and compare it with the GMM-MCMC. The use of RJMCMC is expected to accelerate the calculation process, which can provide the number of optimum clusters automatically; moreover, the MRI image segmentation could become more adaptive. The result shows that from the Correct Classification Ratio (CCR), the GMM-RJMCMC could provide an equal segmentation results compared to the GMM-MCMC, however, GMM-RJMCMC has the advantage, that is faster in executing the algorithm, this makes GMM-RJMCMC more efficient in finding the optimum number of clusters.","PeriodicalId":246056,"journal":{"name":"THE 2ND INTERNATIONAL CONFERENCE ON SCIENCE, MATHEMATICS, ENVIRONMENT, AND EDUCATION","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"THE 2ND INTERNATIONAL CONFERENCE ON SCIENCE, MATHEMATICS, ENVIRONMENT, AND EDUCATION","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1063/1.5139817","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

A brain tumor is the 15th deadly disease in Indonesia according to the WHO in 2018. In medical treatment, brain tumors can be detected through Magnetic Resonance Imaging (MRI). The main problem is how to separate the brain tumor area as the Region of interest (ROI) with the other healthy part (Non-ROI) in the MRI. In the computational statistics, a method used in image segmentation is cluster analysis. Model-Based Clustering with Gaussian Mixture Model (GMM) is often used to find the cluster where the tumor is placed. The EM Algorithm and Bayesian coupled with Markov chain Monte Carlo (MCMC) could be used to optimize the GMM. However, both EM and Bayesian MCMC are assumed that the number of clusters is fixed. Therefore, to select the optimum number of clusters, we have to use certain cluster selection criteria. This process makes the segmentation quite complicated and is not automatic. This study tries to employ the GMM using Reversible Jump Markov Chain Monte Carlo Algorithm (GMM-RJMCMC) to segment the MRI-based brain tumor and compare it with the GMM-MCMC. The use of RJMCMC is expected to accelerate the calculation process, which can provide the number of optimum clusters automatically; moreover, the MRI image segmentation could become more adaptive. The result shows that from the Correct Classification Ratio (CCR), the GMM-RJMCMC could provide an equal segmentation results compared to the GMM-MCMC, however, GMM-RJMCMC has the advantage, that is faster in executing the algorithm, this makes GMM-RJMCMC more efficient in finding the optimum number of clusters.
基于mri的脑肿瘤分割采用高斯混合模型和可逆跳跃马尔可夫链蒙特卡罗算法
根据世界卫生组织2018年的数据,脑肿瘤是印度尼西亚第15大致命疾病。在医学治疗中,脑肿瘤可以通过磁共振成像(MRI)来检测。主要问题是如何在MRI图像中区分作为感兴趣区域(ROI)的脑肿瘤区域与其他健康区域(Non-ROI)。在计算统计学中,一种用于图像分割的方法是聚类分析。基于模型的高斯混合模型聚类(GMM)通常用于寻找肿瘤所在的聚类。EM算法和贝叶斯与马尔可夫链蒙特卡罗(MCMC)相结合可用于GMM的优化。然而,EM和贝叶斯MCMC都假设簇的数量是固定的。因此,为了选择最优的簇数,我们必须使用一定的簇选择标准。这个过程使得分割相当复杂,并且不是自动的。本研究尝试采用可逆跳跃马尔可夫链蒙特卡罗算法(GMM- rjmcmc)对基于mri的脑肿瘤进行分割,并与GMM- mcmc进行比较。使用RJMCMC可以加速计算过程,自动提供最优集群的数量;此外,MRI图像分割具有更强的适应性。结果表明,在正确分类比(CCR)上,GMM-RJMCMC与GMM-MCMC具有相同的分割结果,但GMM-RJMCMC具有更快的算法执行速度的优势,这使得GMM-RJMCMC在寻找最佳簇数方面效率更高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信