Nonrigid 2D/3D Registration of Coronary Artery Models With Live Fluoroscopy for Guidance of Cardiac Interventions

Nonrigid 2D/3D Registration of Coronary Artery Models With Live Fluoroscopy for Guidance of Cardiac Interventions
复制标题

DOI:
10.1109/tmi.2012.2195009
复制
发表时间:
2012-08-01
影响因子:
10.6
通讯作者:
Cheriet, Mohamed
Cheriet, Mohamed
中科院分区:
工程技术1区
文献类型:
--
作者:
Rivest-Henault, David;Sundar, Hari;Cheriet, Mohamed

文献摘要

被引文献

相似文献

提出了一种2D/3D非刚体配准方法,将冠状动脉的3D中心线模型与双平面透视血管摄影相对应。登记的模型被覆盖在介入性血管造影的顶部,以在图像引导的慢性完全闭塞过程中提供手术辅助,从而减少2D介入性图像所固有的不确定性。该方法分为两部分:全局结构配准和局部非刚体配准。在这两种情况下,血管中心线都是从2D透视图像中自动提取的,并作为对准和配准算法的基础。在第一部分中,使用能量最小化方法来估计将中心线与血管图像对齐的全局仿射变换。对9个通用优化器的性能进行了评估,并给出了详细的结果。在第二部分中,提出了一种完全非刚体的配准方法,并用来补偿局部形状差异。该方法基于变分框架,使用同时匹配和重建的过程来计算非刚性配准。在典型的运行时间不到3 S的情况下,该算法对于交互式应用来说已经足够快了。在五个不同的主题上进行了实验,结果令人满意。
A 2D/3D nonrigid registration method is proposed that brings a 3D centerline model of the coronary arteries into correspondence with bi-plane fluoroscopic angiograms. The registered model is overlaid on top of interventional angiograms to provide surgical assistance during image-guided chronic total occlusion procedures, thereby reducing the uncertainty inherent in 2D interventional images. The proposed methodology is divided into two parts: global structural alignment and local nonrigid registration. In both cases, vessel centerlines are automatically extracted from the 2D fluoroscopic images, and serve as the basis for the alignment and registration algorithms. In the first part, an energy minimization method is used to estimate a global affine transformation that aligns the centerline with the angiograms. The performance of nine general purpose optimizers has been assessed for this problem, and detailed results are presented. In the second part, a fully nonrigid registration method is proposed and used to compensate for any local shape discrepancy. This method is based on a variational framework, and uses a simultaneous matching and reconstruction process to compute a nonrigid registration. With a typical run time of less than 3 s, the algorithms are fast enough for interactive applications. Experiments on five different subjects are presented and show promising results.