Biomedical Image Analysis Group, Department of Computing, Imperial College London, UK.
Surgical Planning Laboratory, Brigham and Women's Hospital, Harvard Medical School, Boston, MA, USA; Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Boston, MA, USA.
Med Image Anal. 2014 May;18(4):647-59. doi: 10.1016/j.media.2014.02.006. Epub 2014 Feb 24.
In this paper, we present a graph-based concurrent brain tumor segmentation and atlas to diseased patient registration framework. Both segmentation and registration problems are modeled using a unified pairwise discrete Markov Random Field model on a sparse grid superimposed to the image domain. Segmentation is addressed based on pattern classification techniques, while registration is performed by maximizing the similarity between volumes and is modular with respect to the matching criterion. The two problems are coupled by relaxing the registration term in the tumor area, corresponding to areas of high classification score and high dissimilarity between volumes. In order to overcome the main shortcomings of discrete approaches regarding appropriate sampling of the solution space as well as important memory requirements, content driven samplings of the discrete displacement set and the sparse grid are considered, based on the local segmentation and registration uncertainties recovered by the min marginal energies. State of the art results on a substantial low-grade glioma database demonstrate the potential of our method, while our proposed approach shows maintained performance and strongly reduced complexity of the model.
在本文中,我们提出了一种基于图的并发脑肿瘤分割和图谱到病变患者配准框架。分割和配准问题都使用图像域上叠加的稀疏网格上的统一对离散马尔可夫随机场模型进行建模。分割是基于模式分类技术解决的,而配准是通过最大化体积之间的相似性来完成的,并且相对于匹配标准是模块化的。通过在肿瘤区域中放松配准项来耦合这两个问题,这对应于分类得分高和体积之间差异大的区域。为了克服离散方法在适当抽样解决方案空间和重要内存需求方面的主要缺点,考虑了基于局部分割和注册不确定性的离散位移集和稀疏网格的内容驱动抽样,这些不确定性是通过最小边际能量恢复的。在一个大规模的低级别胶质瘤数据库上的最新结果证明了我们方法的潜力,而我们提出的方法则表现出了保持性能和大大降低模型复杂度的特点。