Optimizing U-Net to Segment Left Ventricle from Magnetic Resonance Imaging

S. Charmchi, K. Punithakumar, P. Boulanger
{"title":"Optimizing U-Net to Segment Left Ventricle from Magnetic Resonance Imaging","authors":"S. Charmchi, K. Punithakumar, P. Boulanger","doi":"10.1109/BIBM.2018.8621552","DOIUrl":null,"url":null,"abstract":"Left ventricle segmentation is an important medical imaging task to measure several diagnostic parameters related to the heart such as ejection fraction and stroke volume. Recently, convolutional neural networks (CNN) have shown great potential in achieving state-of-the-art segmentation results for such applications. However, most of the existing research is focusing on building complicated variations of the neural networks with modest changes to their performance. In this study, the popular U-Net architecture is optimized by analyzing its behaviour once fully trained from which one can simplify its architecture by fixing layers weights or eliminating some of them completely. For instance, by performing a Fourier analysis of the convolution at each layer, we were able to discover that some early layers can be approximated by simple uniform filters. Furthermore, in a separate experiment by removing the middle layers of the U-Net one can reduce the number of U-Net parameters from 31 million to 0.5 million weights without compromising its performance. The experimental evaluations show that the new optimized U-Net achieves 0.93 for the Dice score in comparison to manual ground truth.","PeriodicalId":108667,"journal":{"name":"2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIBM.2018.8621552","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Left ventricle segmentation is an important medical imaging task to measure several diagnostic parameters related to the heart such as ejection fraction and stroke volume. Recently, convolutional neural networks (CNN) have shown great potential in achieving state-of-the-art segmentation results for such applications. However, most of the existing research is focusing on building complicated variations of the neural networks with modest changes to their performance. In this study, the popular U-Net architecture is optimized by analyzing its behaviour once fully trained from which one can simplify its architecture by fixing layers weights or eliminating some of them completely. For instance, by performing a Fourier analysis of the convolution at each layer, we were able to discover that some early layers can be approximated by simple uniform filters. Furthermore, in a separate experiment by removing the middle layers of the U-Net one can reduce the number of U-Net parameters from 31 million to 0.5 million weights without compromising its performance. The experimental evaluations show that the new optimized U-Net achieves 0.93 for the Dice score in comparison to manual ground truth.
利用磁共振成像优化U-Net对左心室进行分段
左心室分割是一项重要的医学成像任务,用于测量射血分数和每搏容量等与心脏相关的诊断参数。最近,卷积神经网络(CNN)在实现此类应用的最先进的分割结果方面显示出巨大的潜力。然而,大多数现有的研究都集中在构建复杂的神经网络变体,并对其性能进行适度的改变。在这项研究中,流行的U-Net架构是通过分析其行为来优化的,一旦完全训练完毕,就可以通过固定层权值或完全消除其中一些来简化其架构。例如,通过对每一层的卷积进行傅里叶分析,我们能够发现一些早期的层可以用简单的均匀滤波器来近似。此外,在一个单独的实验中,通过去除U-Net的中间层,可以将U-Net参数的数量从3100万个权重减少到50万个权重,而不会影响其性能。实验结果表明,优化后的U-Net在Dice得分上达到了0.93。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信