GE Healthcare, London, ON, Canada.
Med Image Anal. 2012 Jan;16(1):87-100. doi: 10.1016/j.media.2011.05.009. Epub 2011 May 26.
This study investigates fast detection of the left ventricle (LV) endo- and epicardium boundaries in a cardiac magnetic resonance (MR) sequence following the optimization of two original discrete cost functions, each containing global intensity and geometry constraints based on the Bhattacharyya similarity. The cost functions and the corresponding max-flow optimization built upon an original bound of the Bhattacharyya measure yield competitive results in nearly real-time. Within each frame, the algorithm seeks the LV cavity and myocardium regions consistent with subject-specific model distributions learned from the first frame in the sequence. Based on global rather than pixel-wise information, the proposed formulation relaxes the need of a large training set and optimization with respect to geometric transformations. Different from related active contour methods, it does not require a large number of iterative updates of the segmentation and the corresponding computationally onerous kernel density estimates (KDEs). The algorithm requires very few iterations and KDEs to converge. Furthermore, the proposed bound can be used for several other applications and, therefore, can lead to segmentation algorithms which share the flexibility of active contours and computational advantages of max-flow optimization. Quantitative evaluations over 2280 images acquired from 20 subjects demonstrated that the results correlate well with independent manual segmentations by an expert. Moreover, comparisons with a related recent active contour method showed that the proposed framework brings significant improvements in regard to accuracy and computational efficiency.
本研究旨在优化两个原始离散代价函数后,快速检测心脏磁共振(MR)序列中左心室(LV)的心内膜和心外膜边界。这两个代价函数都包含基于 Bhattacharyya 相似度的全局强度和几何约束。基于 Bhattacharyya 测度的原始界约束的代价函数和相应的最大流优化可以在近实时的情况下产生有竞争力的结果。在每一帧中,该算法都会寻找与序列中第一帧中从特定于主体的模型分布学习到的 LV 腔和心肌区域一致的区域。与相关的主动轮廓方法不同,该算法基于全局信息而不是像素级信息,因此放宽了对大量训练集和几何变换优化的需求。与相关的主动轮廓方法不同,它不需要对分割进行大量的迭代更新,也不需要进行相应的计算密集型核密度估计(KDE)。该算法只需要很少的迭代次数和 KDE 即可收敛。此外,所提出的界可以用于其他几个应用,因此可以导致具有主动轮廓的灵活性和最大流优化的计算优势的分割算法。在 20 个对象的 2280 多张图像上进行的定量评估表明,该结果与专家的独立手动分割高度相关。此外,与最近的一种相关主动轮廓方法的比较表明,所提出的框架在准确性和计算效率方面有显著的改进。