Brain Tumor Augmentation using the U-NET Architecture

Mohsin Jabbar, M. Siddiqui, Farhan Hussain, Sultan Daud Khan
{"title":"Brain Tumor Augmentation using the U-NET Architecture","authors":"Mohsin Jabbar, M. Siddiqui, Farhan Hussain, Sultan Daud Khan","doi":"10.1109/FIT57066.2022.00063","DOIUrl":null,"url":null,"abstract":"Studies have found out that tumors in brain are one of the fiercest diseases which can ultimately lead to death. Gliomas are the most commonly found primary tumors that are very hard to predict and can be found anywhere in the brain. It is prime objective to differentiate the different tumor tissues such as enhancing tissues, edema, from healthy ones. To do this task, two types of segmentation techniques come into existent i.e. manual and automatic. The automation methods of brain tumor segmentation have gained ground over manual segmentation algorithms and further its estimation is very closer to clinical results. In this paper we propose a comprehensive U-NET architecture with modification in their layers for 2D slices segmentation as a major contribution to BRATS 2015 challenge. Then we enlisted different dataset that are available publicly i.e. BRATS and DICOM. Further, we present a robust frame- work inspired from U-NET model with addition and modification of layers and image pre-processing methodology such as contrast enhancement for visible input and output details. In this way our approach achieves highest dice score 0.92 on the publicly available BRATS 2015 dataset and with better time constraint i.e. training time decreases to 80-90 minute instead of previously 2 to 3 days.","PeriodicalId":102958,"journal":{"name":"2022 International Conference on Frontiers of Information Technology (FIT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Frontiers of Information Technology (FIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FIT57066.2022.00063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Studies have found out that tumors in brain are one of the fiercest diseases which can ultimately lead to death. Gliomas are the most commonly found primary tumors that are very hard to predict and can be found anywhere in the brain. It is prime objective to differentiate the different tumor tissues such as enhancing tissues, edema, from healthy ones. To do this task, two types of segmentation techniques come into existent i.e. manual and automatic. The automation methods of brain tumor segmentation have gained ground over manual segmentation algorithms and further its estimation is very closer to clinical results. In this paper we propose a comprehensive U-NET architecture with modification in their layers for 2D slices segmentation as a major contribution to BRATS 2015 challenge. Then we enlisted different dataset that are available publicly i.e. BRATS and DICOM. Further, we present a robust frame- work inspired from U-NET model with addition and modification of layers and image pre-processing methodology such as contrast enhancement for visible input and output details. In this way our approach achieves highest dice score 0.92 on the publicly available BRATS 2015 dataset and with better time constraint i.e. training time decreases to 80-90 minute instead of previously 2 to 3 days.
使用U-NET架构的脑肿瘤增强
研究发现,脑肿瘤是最严重的疾病之一,最终可导致死亡。胶质瘤是最常见的原发性肿瘤,很难预测,可以在大脑的任何地方发现。主要目的是区分不同的肿瘤组织,如增强组织、水肿组织和健康组织。为了完成这一任务,存在两种类型的分割技术:手动和自动。脑肿瘤分割的自动化方法已经超越了人工分割算法,而且其估计结果更接近临床结果。在本文中,我们提出了一个全面的U-NET架构,修改了二维切片分割的层,作为对BRATS 2015挑战的主要贡献。然后我们收集了不同的公开数据集,即BRATS和DICOM。此外,我们提出了一个受U-NET模型启发的鲁棒框架,其中添加和修改了图层和图像预处理方法,例如对可见输入和输出细节进行对比度增强。通过这种方式,我们的方法在公开可用的BRATS 2015数据集上获得了最高的骰子分数0.92,并且具有更好的时间约束,即训练时间减少到80-90分钟,而不是之前的2到3天。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信