Automatic 3D Prostate Image Segmentation via Patch-based Density Constraints Clustering

Yao Yao, S. Gou, Yang Guang
{"title":"Automatic 3D Prostate Image Segmentation via Patch-based Density Constraints Clustering","authors":"Yao Yao, S. Gou, Yang Guang","doi":"10.1145/3271553.3271571","DOIUrl":null,"url":null,"abstract":"Currently methods on prostate segmentation barely solve the problems about the low prostate CT contrast, high edge ambiguity, surrounding adhesion tissues and especially the tumor motion. To effectively manage those problems in prostate treatment using CT guided radiotherapy, automated segmentation needs to be performed. In this paper, an automatic 3D prostate image segmentation via Patch-based density constraints clustering (PDCC) is developed. The main contributions of this method lie in the following three strategies: 1) compared with only using pixel intensity information, Superpixel-based 3D patch includes more structure contexts to deal with low contrast problem in prostate CT images. 2) Compacting and extracting discriminative information in the each patch with 3D gray-gradient cooccurrence matrix are used to distinguish tiny texture difference between prostate and non-prostate. 3) Density constraints clustering algorithm focus on a higher density than their neighbors' points with relatively small distance to cope with two nearby organs touch together. Further, clusters are recognized regardless of their shape and of the dimensionality of the space in which they are embedded. The proposed method has been evaluated on 10 patients' prostate CT image database where each patient includes 50 treatment images, and several state-of-the-art prostate CT segmentation algorithms with various evaluation metrics have been as comparisons. Experimental results demonstrate that the proposed method achieves higher segmentation accuracy and lower average surface distance.","PeriodicalId":414782,"journal":{"name":"Proceedings of the 2nd International Conference on Vision, Image and Signal Processing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2nd International Conference on Vision, Image and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3271553.3271571","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Currently methods on prostate segmentation barely solve the problems about the low prostate CT contrast, high edge ambiguity, surrounding adhesion tissues and especially the tumor motion. To effectively manage those problems in prostate treatment using CT guided radiotherapy, automated segmentation needs to be performed. In this paper, an automatic 3D prostate image segmentation via Patch-based density constraints clustering (PDCC) is developed. The main contributions of this method lie in the following three strategies: 1) compared with only using pixel intensity information, Superpixel-based 3D patch includes more structure contexts to deal with low contrast problem in prostate CT images. 2) Compacting and extracting discriminative information in the each patch with 3D gray-gradient cooccurrence matrix are used to distinguish tiny texture difference between prostate and non-prostate. 3) Density constraints clustering algorithm focus on a higher density than their neighbors' points with relatively small distance to cope with two nearby organs touch together. Further, clusters are recognized regardless of their shape and of the dimensionality of the space in which they are embedded. The proposed method has been evaluated on 10 patients' prostate CT image database where each patient includes 50 treatment images, and several state-of-the-art prostate CT segmentation algorithms with various evaluation metrics have been as comparisons. Experimental results demonstrate that the proposed method achieves higher segmentation accuracy and lower average surface distance.
基于补丁的密度约束聚类自动三维前列腺图像分割
目前的前列腺分割方法几乎没有解决前列腺CT对比度低、边缘模糊、周围组织粘连,尤其是肿瘤运动的问题。为了有效地解决这些问题,需要进行CT引导放射治疗前列腺的自动分割。本文提出了一种基于patch的密度约束聚类(PDCC)的前列腺图像三维自动分割方法。该方法的主要贡献在于以下三个策略:1)与仅使用像素强度信息相比,基于superpixel的3D patch包含了更多的结构上下文,可以解决前列腺CT图像对比度低的问题。2)利用三维灰度梯度共生矩阵对每个patch进行压缩提取判别信息,区分前列腺和非前列腺的细微纹理差异。3)密度约束聚类算法集中在密度比相邻点高且距离相对较小的点上,以应对两个相邻器官接触在一起的情况。此外,无论它们的形状和它们所嵌入的空间的维度如何,集群都可以被识别。在10例患者的前列腺CT图像数据库中对该方法进行了评估,其中每个患者包括50张治疗图像,并对几种具有不同评估指标的最先进的前列腺CT分割算法进行了比较。实验结果表明,该方法具有较高的分割精度和较低的平均表面距离。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信