【24h】

Myocardial border detection by branch-and-bound dynamic programming in magnetic resonance images.

机译:通过磁共振图像中的分支定界动态编程进行心肌边界检测。

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

摘要

Dynamic programming (DP) is a mathematical technique for making optimal decisions on the sequencing of interrelated problems. It has been used widely to detect borders in magnetic resonance images (MRI). MRI is noninvasive and generates clear images; however, it is impractical for manual measurement of the huge number of images generated by dynamic organs such as those of the cardiovascular system. A fast and effective algorithm is essential for on-line implementation of MRI-based computer aided measurement and diagnosis. In this paper, a branch-and-bound dynamic programming technique is applied to detect the endocardial borders of the left ventricular. The proposed branch-and-bound method drastically reduces the computational time required in conventional exhaustive search methods. Statistical tests are conducted to verify the CPU time performance of the branch-and-bound technique in comparison to the conventional exhaustive search method.
机译:动态编程(DP)是一种数学技术,可根据相关问题的排序做出最佳决策。它已被广泛用于检测磁共振图像(MRI)中的边界。 MRI是非侵入性的,可以产生清晰的图像。但是,手动测量由动态器官(如心血管系统的器官)生成的大量图像是不切实际的。快速有效的算法对于基于MRI的计算机辅助测量和诊断的在线实施至关重要。本文采用分支定界动态程序设计技术检测左心室的心内膜边界。所提出的分支定界方法大大减少了常规穷举搜索方法所需的计算时间。与传统的穷举搜索方法相比,进行统计测试以验证分支定界技术的CPU时间性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号