首页> 外文期刊>Concurrency and computation: practice and experience >An automatic self-initialized clustering method for brain tissue segmentation and pathology detection from magnetic resonance human head scans with graphics processing unitmachine
【24h】

An automatic self-initialized clustering method for brain tissue segmentation and pathology detection from magnetic resonance human head scans with graphics processing unitmachine

机译:磁共振人体头部扫描的脑组织分割和病理检测自动自初始化聚类方法与图形处理闭合机组

获取原文
获取原文并翻译 | 示例
       

摘要

The proposed work introduces a fully automatic modified fuzzy c-means (MFCM) algorithm for segmenting brain tissue into gray matter (GM), white matter (WM), and cerebrospinal fluid (CSF) which identifies the pathological conditions of magnetic resonance human head scans. The present work implements histogram smoothing using Gaussian distribution for finding the number of clusters (K) and cluster centers (C) to initialize modified FCM algorithm (MFCM). The modification includes the local impact of each pixel based on the median of local neighborhoods. This needs more computational power to reduce the processing time and requires a parallel programming environment like the Graphics Processing Unit. The parallel MFCM is performed with the help of compute unified device architecture language and reduced the processing time up to 80 speedup folds than the serial implementation in Matlab and 20 speedup folds than C programming implementation. The method is examined with the Internet Brain Segmentation Repository (IBSR20) T1W dataset. The quantitative and qualitative results of the proposed method are compared with state-of-the-art-methods using the Dice coefficient (DC). Proposed method yields high DC 0.84 +/- 0.03 for GM, 0.83 +/- 0.04 for WM, and 0.41 +/- 0.12 for CSF segmentation. In post-processing, 3D volumes of segmented regions have been constructed and compared with the gold standard quantitatively and qualitatively.
机译:所提出的工作介绍了一种全自动修改的模糊C-MATION(MFCM)算法,用于将脑组织分割成灰质(GM),白质(WM)和脑脊液(CSF),其识别磁共振人体头部扫描的病理条件。目前的工作实现了使用高斯分发的直方图平滑,用于查找群集(k)和群集中心(c)以初始化修改的FCM算法(MFCM)。修改包括基于本地邻域的中位数的每个像素的局部影响。这需要更多的计算能力来减少处理时间,并且需要平行编程环境,如图形处理单元。在计算统一设备架构语言的帮助下执行并行MFCM,并将处理时间减少到80倍的加速度,而不是MATLAB中的串行实现和比C编程实现的20个加速倍数。使用互联网脑分段存储库(IBSR20)T1W数据集检查该方法。将所提出的方法的定量和定性结果与使用骰子系数(DC)的最先进的方法进行比较。所提出的方法为GM的高达DC 0.84 +/- 0.03,WM为0.83 +/- 0.04,CSF分割0.41 +/- 0.12。在后处理中,已经构建了3D卷分段区域,并与金标准定量和定性相比。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号