Suppr超能文献

用于从横截面图像对线状基准点进行空间配准的数值算法。

Numerical algorithms for spatial registration of line fiducials from cross-sectional images.

作者信息

Lee Sangyoon, Fichtinger Gabor, Chirikjian Gregory S

出版信息

Med Phys. 2002 Aug;29(8):1881-91. doi: 10.1118/1.1493777.

Abstract

We present several numerical algorithms for six-degree-of-freedom rigid-body registration of line fiducial objects to their marks in cross-sectional planar images, such as those obtained in CT and MRI, given the correspondence between the marks and line fiducials. The area of immediate application is frame-based stereotactic procedures, such as radiosurgery and functional neurosurgery. The algorithms are also suitable to problems where the fiducial pattern moves inside the imager, as is the case in robot-assisted image-guided surgical applications. We demonstrate the numerical methods on clinical CT images and computer-generated data and compare their performance in terms of robustness to missing data, robustness to noise, and speed. The methods show two unique strengths: (1) They provide reliable registration of incomplete fiducial patterns when up to two-thirds of the total fiducials are missing from the image; and (2) they are applicable to an arbitrary combination of line fiducials without algorithmic modification. The average speed of the fastest algorithm is 0.3236 s for six fiducial lines in real CT data in a Matlab implementation.

摘要

给定标记与线基准之间的对应关系,我们提出了几种数值算法,用于在横截面平面图像(如CT和MRI中获得的图像)中将线基准物体进行六自由度刚体配准到它们的标记上。直接应用领域是基于框架的立体定向手术,如放射外科和功能神经外科。这些算法也适用于基准图案在成像仪内移动的问题,如机器人辅助图像引导手术应用中的情况。我们在临床CT图像和计算机生成的数据上演示了这些数值方法,并在对缺失数据的鲁棒性、对噪声的鲁棒性和速度方面比较了它们的性能。这些方法显示出两个独特的优势:(1)当图像中多达三分之二的总基准缺失时,它们能提供不完整基准图案的可靠配准;(2)它们适用于线基准的任意组合,无需算法修改。在Matlab实现中,最快算法对真实CT数据中的六条基准线的平均速度为0.3236秒。

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验