A feature selection strategy using Markov clustering, for the optimization of brain tumor segmentation from MRI data

IF 0.3 Q4 COMPUTER SCIENCE, THEORY & METHODS Acta Universitatis Sapientiae Informatica Pub Date : 2022-12-01 DOI:10.2478/ausi-2022-0018
Ioan-Marius Pisak-Lukáts, L. Kovács, Szilágyi László
{"title":"A feature selection strategy using Markov clustering, for the optimization of brain tumor segmentation from MRI data","authors":"Ioan-Marius Pisak-Lukáts, L. Kovács, Szilágyi László","doi":"10.2478/ausi-2022-0018","DOIUrl":null,"url":null,"abstract":"Abstract The automatic segmentation of medical images stands at the basis of modern medical diagnosis, therapy planning and follow-up studies after interventions. The accuracy of the segmentation is a key element in assisting the work of the physician, but the efficiency of the process is also relevant. This paper introduces a feature selection strategy that attempts to define reduced feature sets for ensemble learning methods employed in brain tumor segmentation based on MRI data such a way that the segmentation outcome hardly suffers any damage. Initially, the full set of observed and generated features are deployed in ensemble training and prediction on testing data, which provide us information on all couples of features from the full feature set. The extracted pairwise data is fed to a Markov clustering (MCL) algorithm, which uses a graph structure to characterize the relation between features. MCL produces connected subgraphs that are totally separated from each other. The largest such subgraph defines the group of features which are selected for evaluation. The proposed technique is evaluated using the high-grade and low-grade tumor records of the training dataset of the BraTS 2019 challenge, in an ensemble learning framework relying on binary decision trees. The proposed method can reduce the set of features to 30%ofits initial size without losing anything in terms of segmentation accuracy, significantly contributing to the efficiency of the segmentation process. A detailed comparison of the full set of 104 features and the reduced set of 41 features is provided, with special attention to highly discriminative and redundant features within the MRI data.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"5 1","pages":"316 - 337"},"PeriodicalIF":0.3000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Universitatis Sapientiae Informatica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/ausi-2022-0018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract The automatic segmentation of medical images stands at the basis of modern medical diagnosis, therapy planning and follow-up studies after interventions. The accuracy of the segmentation is a key element in assisting the work of the physician, but the efficiency of the process is also relevant. This paper introduces a feature selection strategy that attempts to define reduced feature sets for ensemble learning methods employed in brain tumor segmentation based on MRI data such a way that the segmentation outcome hardly suffers any damage. Initially, the full set of observed and generated features are deployed in ensemble training and prediction on testing data, which provide us information on all couples of features from the full feature set. The extracted pairwise data is fed to a Markov clustering (MCL) algorithm, which uses a graph structure to characterize the relation between features. MCL produces connected subgraphs that are totally separated from each other. The largest such subgraph defines the group of features which are selected for evaluation. The proposed technique is evaluated using the high-grade and low-grade tumor records of the training dataset of the BraTS 2019 challenge, in an ensemble learning framework relying on binary decision trees. The proposed method can reduce the set of features to 30%ofits initial size without losing anything in terms of segmentation accuracy, significantly contributing to the efficiency of the segmentation process. A detailed comparison of the full set of 104 features and the reduced set of 41 features is provided, with special attention to highly discriminative and redundant features within the MRI data.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种基于马尔可夫聚类的特征选择策略,用于从MRI数据中优化脑肿瘤分割
医学图像的自动分割是现代医学诊断、治疗计划和干预后随访研究的基础。分割的准确性是协助医生工作的关键因素,但该过程的效率也是相关的。本文介绍了一种特征选择策略,该策略试图为基于MRI数据的脑肿瘤分割中使用的集成学习方法定义约简特征集,从而使分割结果几乎不受任何损害。最初,完整的观察和生成的特征集被部署在测试数据的集成训练和预测中,这为我们提供了来自完整特征集的所有特征对的信息。将提取的成对数据输入到马尔可夫聚类(MCL)算法中,该算法使用图结构来表征特征之间的关系。MCL产生相互完全分离的连通子图。最大的子图定义了选择用于评估的特征组。在基于二叉决策树的集成学习框架中,使用BraTS 2019挑战赛训练数据集的高级别和低级别肿瘤记录对所提出的技术进行了评估。该方法可以在不影响分割精度的前提下将特征集缩小到初始大小的30%,显著提高了分割过程的效率。提供了完整的104个特征集和简化的41个特征集的详细比较,特别注意MRI数据中的高度判别和冗余特征。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Acta Universitatis Sapientiae Informatica
Acta Universitatis Sapientiae Informatica COMPUTER SCIENCE, THEORY & METHODS-
自引率
0.00%
发文量
9
期刊最新文献
E-super arithmetic graceful labelling of Hi(m, m), Hi(1) (m, m) and chain of even cycles On agglomeration-based rupture degree in networks and a heuristic algorithm On domination in signed graphs Connected certified domination edge critical and stable graphs Eccentric connectivity index in transformation graph Gxy+
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1