首页> 外文会议>Conference on Medical Imaging >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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号