Graph-Based Medical Image Segmentation in 3D and 4D

摘要： 这是我们第一阶段项目的竞争性延续。在成功地实现了所有目标之后，开发了一种新的多表面和/或多目标n-D生物医学图像分割的新框架，并对其进行了验证，并在临床和平移图像分析任务中展示了其实用价值。该第二阶段提案将开发几个重要的扩展，以解决原始框架已确定的局限性，同时保持检测最佳单交互和多交互的能力 N维曲面，包括圆柱体形状、闭合曲面形状和复杂拓扑形状。 将开发新的方法来结合基于形状的先验知识；显著提高处理速度；以及用于交互式操作员指导的分割。 我们假设，通过将分割问题表示为圆弧加权图(而不是迄今使用的节点加权图)，三维和四维多表面多对象最优图搜索将显著提高来自各种医学成像源的体图像数据的分割精度和稳健性，提供灵活性和更高的处理速度，从而导致实时交互性和实用性。 我们建议： 1)开发并验证了一种基于单面和多面n-D图的优化分割方法，该方法使用基于圆弧的图形表示，结合了使用硬约束和软约束的先验形状知识，并在利用基于边、区域和形状的加权组合的同时提供形状指导。 2)开发了一种并行(多核、多线程)最优图搜索方法，显著提高了处理速度，从而提高了该方法对高维、多交互和全局更大问题的适用性。 3)开发和评估一种高效的实时方法，用于交互使用结合了专家-用户指导的单表面和多表面分割，同时保持3-D或4-D分割的高度自动化特征。 将对照第一阶段方法对所开发的方法进行评估，以证明在具有足够大小的数据样本的各种任务中具有统计上显著的性能改进。

Abstract: This is a competitive continuation of our Phase-I project. After successfully fulfilling all of its aims, a novel framework for optimal multi-surface and/or multi-object n-D biomedical image segmentation was developed, validated, and its practical utility demonstrated in clinical and translational image analysis tasks. This Phase-II proposal will develop several important extensions addressing identified limitations of the original framework while maintaining the ability of detecting optimal single and multiple interacting surfaces in n-D, including cylindrical shapes, closed-surface shapes, and shapes of complex topology. Novel methods will be developed for incorporation of shape-based a priori knowledge; substantial improvement of processing speed; and for interactive operator-guided segmentation. We hypothesize that by representing the segmentation problem in an arc-weighted graph (instead of the so-far utilized node-weighted graph), the 3-D and 4-D multi-surface multi-object optimal graph searching will offer significantly increased segmentation accuracy and robustness in volumetric image data from a variety of medical imaging sources, offering flexibility and higher processing speed, leading to real-time interactivity and practical applicability. We propose to: 1) Develop and validate a single- and multiple-surface n-D graph-based optimal segmentation method that uses arc-based graph representation, incorporates a priori shape knowledge using hard and soft constraints, and provides shape guidance while utilizing weighted combinations of edge-, region-, and shape-based costs. 2) Develop an approach for parallel (multi-core, multi-threaded) optimal graph search to significantly increase the processing speed and thus improving the method's applicability to higher-dimensional, multiply interacting, and overall larger problems. 3) Develop and evaluate an efficient real-time approach for interactive use of single- and multiple surface segmentations incorporating expert-user guidance while maintaining highly automated character of 3-D or 4-D segmentation. The developed methods will be evaluated against the Phase-I methods to demonstrate statistically significant performance improvements in a variety of tasks with data samples of sufficient sizes.