基于改进图切割的胸部CT图像肺分割

Shuangfeng Dai, K. Lu, Jiyang Dong
{"title":"基于改进图切割的胸部CT图像肺分割","authors":"Shuangfeng Dai, K. Lu, Jiyang Dong","doi":"10.1109/ACPR.2015.7486502","DOIUrl":null,"url":null,"abstract":"Lung segmentation is often performed as a preprocessing step on chest Computed Tomography (CT) images because it is important for identifying lung diseases in clinical evaluation. Hence, researches on lung segmentation have received much attention. In this paper, we propose a new lung segmentation method based on an improved graph cuts algorithm from the energy function. First, the lung CT images is modeled with Gaussian mixture models (GMMs), and the optimized distribution parameters can be obtained with expectation maximization (EM) algorithm. With that parameters, we can construct the improved regional penalty item in the graph cuts energy function. Second, considering the image edge information, the Sobel operator is adopted to detect and extract the lung image edges, and the lung image edges information is used to improve the boundary penalty item of graph cuts energy function. Finally, the improved energy function of graph cuts algorithm is obtained, then the corresponding graph is created, and lung is segmented with the minimum cut theory. The experiments demonstrate that the proposed method is very accurate and efficient for lung segmentation.","PeriodicalId":240902,"journal":{"name":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Lung segmentation with improved graph cuts on chest CT images\",\"authors\":\"Shuangfeng Dai, K. Lu, Jiyang Dong\",\"doi\":\"10.1109/ACPR.2015.7486502\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Lung segmentation is often performed as a preprocessing step on chest Computed Tomography (CT) images because it is important for identifying lung diseases in clinical evaluation. Hence, researches on lung segmentation have received much attention. In this paper, we propose a new lung segmentation method based on an improved graph cuts algorithm from the energy function. First, the lung CT images is modeled with Gaussian mixture models (GMMs), and the optimized distribution parameters can be obtained with expectation maximization (EM) algorithm. With that parameters, we can construct the improved regional penalty item in the graph cuts energy function. Second, considering the image edge information, the Sobel operator is adopted to detect and extract the lung image edges, and the lung image edges information is used to improve the boundary penalty item of graph cuts energy function. Finally, the improved energy function of graph cuts algorithm is obtained, then the corresponding graph is created, and lung is segmented with the minimum cut theory. The experiments demonstrate that the proposed method is very accurate and efficient for lung segmentation.\",\"PeriodicalId\":240902,\"journal\":{\"name\":\"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACPR.2015.7486502\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 3rd IAPR Asian Conference on Pattern Recognition (ACPR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACPR.2015.7486502","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

肺分割通常作为胸部计算机断层扫描(CT)图像的预处理步骤进行,因为它对临床评估肺部疾病的识别很重要。因此,肺分割的研究备受关注。本文提出了一种基于能量函数的改进图切算法的肺分割新方法。首先,利用高斯混合模型(GMMs)对肺部CT图像进行建模,利用期望最大化(EM)算法获得优化后的分布参数;利用这些参数,我们可以在图切能量函数中构造改进的区域惩罚项。其次,考虑图像边缘信息,采用Sobel算子对肺图像边缘进行检测和提取,并利用肺图像边缘信息改进图切能量函数的边界惩罚项;最后,得到改进的图切算法的能量函数,建立相应的图,并利用最小切理论对肺进行分割。实验结果表明,该方法具有较高的分割精度和分割效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Lung segmentation with improved graph cuts on chest CT images
Lung segmentation is often performed as a preprocessing step on chest Computed Tomography (CT) images because it is important for identifying lung diseases in clinical evaluation. Hence, researches on lung segmentation have received much attention. In this paper, we propose a new lung segmentation method based on an improved graph cuts algorithm from the energy function. First, the lung CT images is modeled with Gaussian mixture models (GMMs), and the optimized distribution parameters can be obtained with expectation maximization (EM) algorithm. With that parameters, we can construct the improved regional penalty item in the graph cuts energy function. Second, considering the image edge information, the Sobel operator is adopted to detect and extract the lung image edges, and the lung image edges information is used to improve the boundary penalty item of graph cuts energy function. Finally, the improved energy function of graph cuts algorithm is obtained, then the corresponding graph is created, and lung is segmented with the minimum cut theory. The experiments demonstrate that the proposed method is very accurate and efficient for lung segmentation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信