面向实时多模态三维医学图像配准

T. Netsch, P. Rösch, A. V. Muiswinkel, J. Weese
{"title":"面向实时多模态三维医学图像配准","authors":"T. Netsch, P. Rösch, A. V. Muiswinkel, J. Weese","doi":"10.1109/ICCV.2001.937595","DOIUrl":null,"url":null,"abstract":"Intensity value-based registration is a widely used technique for the spatial alignment of medical images. Generally, the registration transformation is determined by iteratively optimizing a similarity measure calculated from the grey values of both images. However, such algorithms may have high computational costs, especially in the case of multi-modality registration, which makes their integration into systems difficult. At present, registration based on mutual information (MI) still requires computation times of the order of several minutes. In this contribution we focus on a new similarity measure based on local correlation (LC) which is well-suited for numerical optimization. We show that LC can be formulated as a least-squares criterion which allows the use of dedicated methods. Thus, it is possible to register MR neuro perfusion time-series (128/sup 2//spl times/30 voxel, 40 images) on a moderate workstation in real-time: the registration of an image takes about 500 ms and is therefore several times faster than image acquisition time. For the registration of CT-MR images (512/sup 2//spl times/87 CT 256/sup 2//spl times/128 MR) a multiresolution framework is used. On top of the decomposition, which requires 47 s of computation time, the optimization with an algorithm based on Ml previously described in the literature takes 97 s. In contrast, the proposed approach only takes 13 s, corresponding to a speedup about a factor of 7. Furthermore, we demonstrate that the superior computational performance of LC is not gained at the expense of accuracy. In particular experiments with dual contrast MR images providing ground truth for the registration show a comparable sub-voxel accuracy of LC and MI similarity.","PeriodicalId":429441,"journal":{"name":"Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"64","resultStr":"{\"title\":\"Towards real-time multi-modality 3-D medical image registration\",\"authors\":\"T. Netsch, P. Rösch, A. V. Muiswinkel, J. Weese\",\"doi\":\"10.1109/ICCV.2001.937595\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Intensity value-based registration is a widely used technique for the spatial alignment of medical images. Generally, the registration transformation is determined by iteratively optimizing a similarity measure calculated from the grey values of both images. However, such algorithms may have high computational costs, especially in the case of multi-modality registration, which makes their integration into systems difficult. At present, registration based on mutual information (MI) still requires computation times of the order of several minutes. In this contribution we focus on a new similarity measure based on local correlation (LC) which is well-suited for numerical optimization. We show that LC can be formulated as a least-squares criterion which allows the use of dedicated methods. Thus, it is possible to register MR neuro perfusion time-series (128/sup 2//spl times/30 voxel, 40 images) on a moderate workstation in real-time: the registration of an image takes about 500 ms and is therefore several times faster than image acquisition time. For the registration of CT-MR images (512/sup 2//spl times/87 CT 256/sup 2//spl times/128 MR) a multiresolution framework is used. On top of the decomposition, which requires 47 s of computation time, the optimization with an algorithm based on Ml previously described in the literature takes 97 s. In contrast, the proposed approach only takes 13 s, corresponding to a speedup about a factor of 7. Furthermore, we demonstrate that the superior computational performance of LC is not gained at the expense of accuracy. In particular experiments with dual contrast MR images providing ground truth for the registration show a comparable sub-voxel accuracy of LC and MI similarity.\",\"PeriodicalId\":429441,\"journal\":{\"name\":\"Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"64\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCV.2001.937595\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCV.2001.937595","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 64

摘要

基于强度值的配准是一种应用广泛的医学图像空间对准技术。一般来说,配准变换是通过迭代优化从两幅图像的灰度值计算出的相似度来确定的。然而,这种算法可能具有很高的计算成本,特别是在多模态配准的情况下,这使得它们难以集成到系统中。目前,基于互信息(MI)的配准仍然需要几分钟的计算时间。在这篇贡献中,我们重点研究了一种新的基于局部相关(LC)的相似性度量,它非常适合于数值优化。我们表明,LC可以被表述为最小二乘准则,它允许使用专用的方法。因此,可以在中等工作站上实时注册MR神经灌注时间序列(128/sup 2//spl次/30体素,40张图像):图像的注册大约需要500 ms,因此比图像采集时间快几倍。对于CT-MR图像的配准(512/sup 2//spl次/87 CT 256/sup 2//spl次/128 MR),使用多分辨率框架。除了分解需要47秒的计算时间外,先前文献中描述的基于Ml的算法优化需要97秒。相比之下,所提出的方法只需要13秒,相当于大约7倍的加速。此外,我们证明了LC的优越计算性能并不是以牺牲精度为代价获得的。特别是双对比MR图像的实验,为配准提供了基础真理,显示出LC和MI相似度的亚体素精度相当。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Towards real-time multi-modality 3-D medical image registration
Intensity value-based registration is a widely used technique for the spatial alignment of medical images. Generally, the registration transformation is determined by iteratively optimizing a similarity measure calculated from the grey values of both images. However, such algorithms may have high computational costs, especially in the case of multi-modality registration, which makes their integration into systems difficult. At present, registration based on mutual information (MI) still requires computation times of the order of several minutes. In this contribution we focus on a new similarity measure based on local correlation (LC) which is well-suited for numerical optimization. We show that LC can be formulated as a least-squares criterion which allows the use of dedicated methods. Thus, it is possible to register MR neuro perfusion time-series (128/sup 2//spl times/30 voxel, 40 images) on a moderate workstation in real-time: the registration of an image takes about 500 ms and is therefore several times faster than image acquisition time. For the registration of CT-MR images (512/sup 2//spl times/87 CT 256/sup 2//spl times/128 MR) a multiresolution framework is used. On top of the decomposition, which requires 47 s of computation time, the optimization with an algorithm based on Ml previously described in the literature takes 97 s. In contrast, the proposed approach only takes 13 s, corresponding to a speedup about a factor of 7. Furthermore, we demonstrate that the superior computational performance of LC is not gained at the expense of accuracy. In particular experiments with dual contrast MR images providing ground truth for the registration show a comparable sub-voxel accuracy of LC and MI similarity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信