首页> 外文期刊>Image and Vision Computing >Matching of anatomical tree structures for registration of medical images
【24h】

Matching of anatomical tree structures for registration of medical images

机译:匹配解剖树结构以进行医学图像配准

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

摘要

Many medical applications require a registration of different images of the same organ. In many cases, such a registration is accomplished by manual placement of landmarks in the images. In this paper, we propose a method which is able to find reasonable landmarks automatically. To achieve this, bifurcations of the vessel systems, which have been extracted from the images by a segmentation algorithm, are assigned by the so-called association graph method and the coordinates of these matched bifurcations can be used as landmarks for a non-rigid registration algorithm. Several constraints to be used in combination with the association graph method are proposed and evaluated on a ground truth consisting of anatomical trees from liver and lung. Furthermore, a method for preprocessing (tree pruning) as well as for postprocessing (clique augmentation) are proposed and evaluated on this ground truth. The proposed method achieves promising results for anatomical trees of liver and lung and for medical images obtained with different modalities and at different points in time.
机译:许多医疗应用需要对同一器官的不同图像进行配准。在许多情况下,这样的配准是通过在图像中手动放置界标来完成的。在本文中,我们提出了一种能够自动找到合理地标的方法。为此,通过所谓的关联图法分配通过分割算法从图像中提取的血管系统的分叉点,并将这些匹配的分叉点的坐标用作非刚性配准的界标。算法。提出了一些要与关联图方法结合使用的约束条件,并根据由肝脏和肺部解剖树构成的地面真实性进行了评估。此外,提出了一种用于预处理(树修剪)以及用于后处理(树状增强)的方法,并以此为基础进行了评估。所提出的方法对于肝和肺的解剖树以及以不同的方式和在不同的时间点获得的医学图像都取得了有希望的结果。

著录项

  • 来源
    《Image and Vision Computing》 |2009年第7期|923-933|共11页
  • 作者单位

    German Research Center for Artificial Intelligence (DFKI), Robotics Lab, Robert Hooke Str. 5, 28359 Bremen, Germany;

    MeVis Research GmbH, Universitaetsallee 29, 28359 Bremen, Germany;

    MeVis Research GmbH, Universitaetsallee 29, 28359 Bremen, Germany;

    MeVis Research GmbH, Universitaetsallee 29, 28359 Bremen, Germany;

    MeVis Research GmbH, Universitaetsallee 29, 28359 Bremen, Germany;

    University of Muenster, Faculty of Mathematics and Computer Science, Einsteinstrasse 62, 48149 Muenster, Germany;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    tree matching; image registration; maximum clique;

    机译:树匹配;图像配准;最大集团;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号