Integration of Morphology and Graph-based Techniques for Fully Automatic Liver Segmentation

Q4 Engineering
W. Yussof, H. Burkhardt
{"title":"Integration of Morphology and Graph-based Techniques for Fully Automatic Liver Segmentation","authors":"W. Yussof, H. Burkhardt","doi":"10.1234/MJEE.V4I3.322","DOIUrl":null,"url":null,"abstract":"Here a fully 3D algorithm for automatic liver segmentation from CT volumetric datasets is presented. The algorithm starts by smoothing the original volume using anisotropic diffusion. The coarse liver region is obtained from the threshold process that is based on a priori knowledge. Then, several morphological operations is performed such as operating the liver to detach the unwanted region connected to the liver and finding the largest component using the connected component labeling (CCL) algorithm. At this stage, both 3D and 2D CCL is done subsequently. However, in 2D CCL, the adjacent slices are also affected from current slice changes. Finally, the boundary of the liver is refined using graph-cuts solver. Our algorithm does not require any user interaction or training datasets to be used. The algorithm has been evaluated on 10 CT scans of the liver and the results are encouraging to poor quality of images.","PeriodicalId":37804,"journal":{"name":"Majlesi Journal of Electrical Engineering","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Majlesi Journal of Electrical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1234/MJEE.V4I3.322","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 9

Abstract

Here a fully 3D algorithm for automatic liver segmentation from CT volumetric datasets is presented. The algorithm starts by smoothing the original volume using anisotropic diffusion. The coarse liver region is obtained from the threshold process that is based on a priori knowledge. Then, several morphological operations is performed such as operating the liver to detach the unwanted region connected to the liver and finding the largest component using the connected component labeling (CCL) algorithm. At this stage, both 3D and 2D CCL is done subsequently. However, in 2D CCL, the adjacent slices are also affected from current slice changes. Finally, the boundary of the liver is refined using graph-cuts solver. Our algorithm does not require any user interaction or training datasets to be used. The algorithm has been evaluated on 10 CT scans of the liver and the results are encouraging to poor quality of images.
基于形态学和图的全自动肝脏分割技术的集成
本文提出了一种基于CT体积数据集的全三维肝脏自动分割算法。该算法首先使用各向异性扩散平滑原始体积。粗肝区域由基于先验知识的阈值处理获得。然后,对肝脏进行形态学操作,去除与肝脏相连的无用区域,并使用连接分量标记(CCL)算法寻找最大分量。在此阶段,3D和2D CCL随后完成。然而,在二维CCL中,相邻的切片也会受到当前切片变化的影响。最后,利用图切求解器对肝脏的边界进行了细化。我们的算法不需要使用任何用户交互或训练数据集。该算法已在10个肝脏CT扫描上进行了评估,结果令人鼓舞,但图像质量较差。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Majlesi Journal of Electrical Engineering
Majlesi Journal of Electrical Engineering Engineering-Electrical and Electronic Engineering
CiteScore
1.20
自引率
0.00%
发文量
9
期刊介绍: The scope of Majlesi Journal of Electrcial Engineering (MJEE) is ranging from mathematical foundation to practical engineering design in all areas of electrical engineering. The editorial board is international and original unpublished papers are welcome from throughout the world. The journal is devoted primarily to research papers, but very high quality survey and tutorial papers are also published. There is no publication charge for the authors.
×
引用
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学术官方微信