...
首页> 外文期刊>Multidimensional systems and signal processing >A new lattice Boltzmann algorithm for assembling local statistical information with MR brain imaging segmentation applications
【24h】

A new lattice Boltzmann algorithm for assembling local statistical information with MR brain imaging segmentation applications

机译:一种新的晶格Boltzmann算法,用于组装与脑成像分割应用的局部统计信息

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

摘要

Recently, the lattice Boltzmann (LB) model has been used in medical imaging segmentation as alternatives for level set methods. The advantages of the LB model include its simple programming and the fact that it is easily paralleled, which can shorten computing times during real-time processing. However, traditional LB algorithms often fail to segment magnetic resonance (MR) brain images, which usually contain low-contrast intensity levels, noise and bias field. To solve these problems, this paper proposes a new LB algorithm assembled by local statistical region information, which can increase the between-class variances of the foreground and background by reducing intra-class variations and can achieve a better anti-noise performance by smoothing the noise of neighborhood pixels. To test its effectiveness and efficiency, comparison experiments were carried out with other LB and non-LB algorithms. The results show that our algorithm was validated on synthetic images and real MR images with desirable performance in the presence of low-contrast gray levels and noise. It also achieved best segmentation performance (with Dice coefficient 97.9 %) compared to other algorithms (with Dice coefficient 80.33, 58.11, 88.2, 81.77, 96.1 % respectively). In addition, the computing speed of the new algorithm is acceptable (18.65-27.62 s).
机译:最近,晶格Boltzmann(LB)模型已被用于医学成像分段作为水平设定方法的替代方案。 LB模型的优点包括其简单的编程和它很容易平行的事实,这可以在实时处理期间缩短计算时间。然而,传统的LB算法通常无法分段磁共振(MR)脑图像,其通常包含低对比度强度水平,噪声和偏置场。为了解决这些问题,本文提出了一种通过局部统计区域信息组装的新的LB算法,这可以通过减少类内变型来增加前景和背景的类别差异,并且可以通过平滑逐级变化来实现更好的抗噪声性能邻居像素的噪声。为了测试其有效性和效率,使用其他LB和非LB算法进行比较实验。结果表明,在存在低对比度灰度水平和噪声的情况下,我们的算法在合成图像和实际MR图像上验证了具有所需性能的。与其他算法(分别为骰子系数80.3,58.11,88.2,81.77,96.1%),还达到了最佳的分割性能(骰子系数97.9%)。此外,新算法的计算速度是可接受的(18.65-27.62秒)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号