神经外科和神经放射治疗应用的注册

E. Cuchet, J. Knoplioch, D. Dormont M.D., C. Marsault M.D.
{"title":"神经外科和神经放射治疗应用的注册","authors":"E. Cuchet,&nbsp;J. Knoplioch,&nbsp;D. Dormont M.D.,&nbsp;C. Marsault M.D.","doi":"10.1002/(SICI)1522-712X(1995)1:4<198::AID-IGS2>3.0.CO;2-5","DOIUrl":null,"url":null,"abstract":"<p>Because of the high level of accuracy needed in neurosurgery, many computer-assisted surgery (CAS) and augmented reality techniques have been developed in this field. A common issue with all of these techniques is registration between preoperative three-dimensional images (computed tomography and magnetic resonance imaging) and the patient in the operating room. We present, in the first part of this paper, a survey of the latest CAS technologies, using fully automatic registration without fiducial landmarks. All of the registration algorithms described are based on minimization of a cost function. We then describe our approach. Our cost function is simply the mean square error (MSE), minimized by the iterative closest point algorithm (ICP). Because the weak point of the ICP algorithm is the closest point computational cost, we precalculate it by a “closest point map,” inspired from classical distance map. We finally perturb the found solution to eliminate local minima close to the global minimum. This paper summarizes the various methods presented. We study the shape of the different cost functions and show that there is no need for a complex cost function. MSE has sufficiently good convergence properties to reach a position very close to the global minimum. We also demonstrate the influence of a final perturbation of the found solution to improve registration. Finally, we test the registration on different regions of the patient's head. <i>J Image Guid Surg 1:198–207 (1995).</i> © 1996 Wiley-Liss, Inc.</p>","PeriodicalId":79505,"journal":{"name":"Journal of image guided surgery","volume":"1 4","pages":"198-207"},"PeriodicalIF":0.0000,"publicationDate":"1995-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"53","resultStr":"{\"title\":\"Registration in neurosurgery and neuroradiotherapy applications\",\"authors\":\"E. Cuchet,&nbsp;J. Knoplioch,&nbsp;D. Dormont M.D.,&nbsp;C. Marsault M.D.\",\"doi\":\"10.1002/(SICI)1522-712X(1995)1:4<198::AID-IGS2>3.0.CO;2-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Because of the high level of accuracy needed in neurosurgery, many computer-assisted surgery (CAS) and augmented reality techniques have been developed in this field. A common issue with all of these techniques is registration between preoperative three-dimensional images (computed tomography and magnetic resonance imaging) and the patient in the operating room. We present, in the first part of this paper, a survey of the latest CAS technologies, using fully automatic registration without fiducial landmarks. All of the registration algorithms described are based on minimization of a cost function. We then describe our approach. Our cost function is simply the mean square error (MSE), minimized by the iterative closest point algorithm (ICP). Because the weak point of the ICP algorithm is the closest point computational cost, we precalculate it by a “closest point map,” inspired from classical distance map. We finally perturb the found solution to eliminate local minima close to the global minimum. This paper summarizes the various methods presented. We study the shape of the different cost functions and show that there is no need for a complex cost function. MSE has sufficiently good convergence properties to reach a position very close to the global minimum. We also demonstrate the influence of a final perturbation of the found solution to improve registration. Finally, we test the registration on different regions of the patient's head. <i>J Image Guid Surg 1:198–207 (1995).</i> © 1996 Wiley-Liss, Inc.</p>\",\"PeriodicalId\":79505,\"journal\":{\"name\":\"Journal of image guided surgery\",\"volume\":\"1 4\",\"pages\":\"198-207\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"53\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of image guided surgery\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/%28SICI%291522-712X%281995%291%3A4%3C198%3A%3AAID-IGS2%3E3.0.CO%3B2-5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of image guided surgery","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/%28SICI%291522-712X%281995%291%3A4%3C198%3A%3AAID-IGS2%3E3.0.CO%3B2-5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 53

摘要

由于神经外科对准确度的要求很高,许多计算机辅助手术(CAS)和增强现实技术在这一领域得到了发展。所有这些技术的一个共同问题是术前三维图像(计算机断层扫描和磁共振成像)与手术室中患者的配准。在本文的第一部分中,我们介绍了最新的CAS技术,使用无基准地标的全自动配准。所描述的所有配准算法都是基于代价函数的最小化。然后我们描述我们的方法。我们的成本函数是简单的均方误差(MSE),通过迭代最近点算法(ICP)最小化。由于ICP算法的弱点是最近点的计算成本,我们通过“最近点图”来预先计算它,灵感来自经典的距离图。最后,我们对找到的解进行扰动,以消除接近全局最小值的局部最小值。本文总结了目前提出的各种方法。我们研究了不同代价函数的形状,并表明不需要复杂的代价函数。MSE具有足够好的收敛性,可以达到非常接近全局最小值的位置。我们还证明了最终扰动对找到的解的影响,以改善配准。最后,我们在患者头部的不同区域进行了注册测试。[J] .影像导报,1998,19(2):1 - 7。©1996 Wiley-Liss, Inc
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Registration in neurosurgery and neuroradiotherapy applications

Because of the high level of accuracy needed in neurosurgery, many computer-assisted surgery (CAS) and augmented reality techniques have been developed in this field. A common issue with all of these techniques is registration between preoperative three-dimensional images (computed tomography and magnetic resonance imaging) and the patient in the operating room. We present, in the first part of this paper, a survey of the latest CAS technologies, using fully automatic registration without fiducial landmarks. All of the registration algorithms described are based on minimization of a cost function. We then describe our approach. Our cost function is simply the mean square error (MSE), minimized by the iterative closest point algorithm (ICP). Because the weak point of the ICP algorithm is the closest point computational cost, we precalculate it by a “closest point map,” inspired from classical distance map. We finally perturb the found solution to eliminate local minima close to the global minimum. This paper summarizes the various methods presented. We study the shape of the different cost functions and show that there is no need for a complex cost function. MSE has sufficiently good convergence properties to reach a position very close to the global minimum. We also demonstrate the influence of a final perturbation of the found solution to improve registration. Finally, we test the registration on different regions of the patient's head. J Image Guid Surg 1:198–207 (1995). © 1996 Wiley-Liss, Inc.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信