首页> 外文会议>Image Processing pt.1; Progress in Biomedical Optics and Imaging; vol.7 no.30 >Globally Optimal Model-based Matching of Anatomical Trees
【24h】

Globally Optimal Model-based Matching of Anatomical Trees

机译:基于全局最优模型的解剖树匹配

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

摘要

Modern MDCT and micro-CT scanners are able to produce high-resolution three-dimensional (3D) images of anatomical trees, such as the airway tree and the heart and liver vasculature. An important problem arising in many contexts is the matching of trees depicted in two different images. Three basic steps are used in order to match two trees: (1) image segmentation, to extract the raw trees from a given pair of 3D images; (2) axial-analysis, to define the underlying centerline structure of the trees; and (3) tree matching, to match the centerline structures of the trees. We focus on step (3). This task is complicated by several problems associated with current segmentation and axial-analysis methods, including missing branches, false branches, and other topological errors in the extracted trees. We propose a model-based approach in which the extracted trees are assumed to arise from an initially unknown common structure corrupted by a sequence of modelled topological deformations. We employ a novel mathematical framework to directly incorporate this model into the matching problem. Under this framework, it is possible to define the set of matches that are consistent with a given deformation model. The optimal match is the member of this set that maximizes a user-definable similarity measure. We present several such similarity measures based upon geometrical attributes (e.g., branch lengths, branching angles, and relative branchpoint locations as measured from the 3D image data). We locate the globally optimal match via an efficient dynamic programming algorithm. Our primary analytical result is a set of sufficient conditions on the user-definable similarity measure such that our dynamic programming algorithm is guaranteed to locate an optimal match. Experimental results have been generated for 3D human CT chest scans and micro-CT coronary arterial-tree images of mice. The resulting matches are in good agreement with correspondences defined by human experts.
机译:现代MDCT和micro-CT扫描仪能够生成解剖树的高分辨率三维(3D)图像,例如气道树以及心脏和肝脏的脉管系统。在许多情况下出现的重要问题是在两个不同图像中描绘的树木的匹配。为了匹配两棵树,使用了三个基本步骤:(1)图像分割,从给定的一对3D图像中提取原始树; (2)轴向分析,以定义树木的基本中心线结构; (3)树匹配,以匹配树的中心线结构。我们专注于步骤(3)。与当前的分割和轴向分析方法相关的若干问题使此任务变得复杂,包括丢失的分支,错误的分支以及提取的树中的其他拓扑错误。我们提出了一种基于模型的方法,其中假定提取的树是由最初未知的公共结构产生的,该结构被一系列建模的拓扑变形破坏了。我们采用了新颖的数学框架,可以将该模型直接整合到匹配问题中。在此框架下,可以定义与给定变形模型一致的一组匹配项。最佳匹配是该集合的成员,该集合可最大化用户可定义的相似性度量。我们基于几何属性(例如,从3D图像数据中测得的分支长度,分支角度和相对分支点位置)提出了几种此类相似性度量。我们通过高效的动态规划算法来定位全局最佳匹配。我们的主要分析结果是用户可定义的相似性度量上的一组充分条件,因此我们的动态编程算法可确保找到最佳匹配。对于小鼠的3D人CT胸部扫描和微CT冠状动脉树图像,已经产生了实验结果。所产生的匹配与人类专家定义的对应非常吻合。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号