Unsupervised and Fully Autonomous 3D Medical Image Segmentation Based on Grow Cut

Alexandru-Ion Marinescu, Z. Bálint, L. Dioşan, A. Andreica
{"title":"Unsupervised and Fully Autonomous 3D Medical Image Segmentation Based on Grow Cut","authors":"Alexandru-Ion Marinescu, Z. Bálint, L. Dioşan, A. Andreica","doi":"10.1109/SYNASC.2018.00068","DOIUrl":null,"url":null,"abstract":"Extending and optimizing cellular automata to handle 3D volume segmentation is a non-trivial task. First, it does not suffice to simply alter the cell neighborhood (be it von Neumann or Moore), and second, going from 2D to 3D means that the number of operations increases by an order of magnitude, thus GPU acceleration becomes a necessity, advantage inherent to cellular automata approaches. When discussing 3D medical imagistics, we mean that the entire stack of slices from a certain sequence within an acquisition is stored as a single entity. This, in turn, enables us to accurately segment whole volumes in a single run, which would otherwise need per-slice segmentation followed by a stitching post-process. This paper focuses mainly on a thorough benchmark analysis of the 3D Unsupervised Grow Cut technique. We discuss algorithm speed of convergence, stability and behavior with respect to global meta-parameters such as segmentation threshold, keeping track of output quality metrics as the algorithm unfolds. Our end goal is to segment the heart cavities from cardiac MRI and to yield an interactive 3D reconstruction which can be easily handled and analyzed by the radiologist.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2018.00068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Extending and optimizing cellular automata to handle 3D volume segmentation is a non-trivial task. First, it does not suffice to simply alter the cell neighborhood (be it von Neumann or Moore), and second, going from 2D to 3D means that the number of operations increases by an order of magnitude, thus GPU acceleration becomes a necessity, advantage inherent to cellular automata approaches. When discussing 3D medical imagistics, we mean that the entire stack of slices from a certain sequence within an acquisition is stored as a single entity. This, in turn, enables us to accurately segment whole volumes in a single run, which would otherwise need per-slice segmentation followed by a stitching post-process. This paper focuses mainly on a thorough benchmark analysis of the 3D Unsupervised Grow Cut technique. We discuss algorithm speed of convergence, stability and behavior with respect to global meta-parameters such as segmentation threshold, keeping track of output quality metrics as the algorithm unfolds. Our end goal is to segment the heart cavities from cardiac MRI and to yield an interactive 3D reconstruction which can be easily handled and analyzed by the radiologist.
基于Grow Cut的无监督和全自动3D医学图像分割
扩展和优化元胞自动机来处理三维体分割是一项非常重要的任务。首先,仅仅改变细胞邻域是不够的(无论是冯·诺伊曼还是摩尔),其次,从2D到3D意味着操作数量增加了一个数量级,因此GPU加速成为必要,这是细胞自动机方法固有的优势。当讨论3D医学成像时,我们的意思是在采集中从特定序列中获得的整个切片堆栈被存储为单个实体。这反过来又使我们能够在一次运行中准确地分割整个卷,否则需要每个切片分割,然后进行拼接后处理。本文主要对三维无监督生长切割技术进行了全面的基准分析。我们讨论了算法的收敛速度、稳定性和关于全局元参数(如分割阈值)的行为,并在算法展开时跟踪输出质量指标。我们的最终目标是从心脏MRI中分割心脏腔,并产生一个交互式3D重建,可以很容易地由放射科医生处理和分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信