Extension of the ICP algorithm to non-rigid intensity-based registration of 3D volumes

J. Feldmar, G. Malandain, J. Declerck, N. Ayache
{"title":"Extension of the ICP algorithm to non-rigid intensity-based registration of 3D volumes","authors":"J. Feldmar, G. Malandain, J. Declerck, N. Ayache","doi":"10.1109/MMBIA.1996.534060","DOIUrl":null,"url":null,"abstract":"Presents a new registration and gain correction algorithm for 3D medical images. It is intensity based. The basic idea is to represent the images by 4D points (x/sub j/, y/sub j/, z/sub j/, i/sub j/) and to define a global energy function based on this representation. For minimization, the authors propose a technique which does not require to compute the derivatives of this criterion with respect to the parameters. It can be understood as an extension of the Iterative Closest Point algorithm (P. Besl and N. McKay, 1992; Z. Zhang, 1992) or as an application of the formalism proposed by L. Cohen (Use of auxiliary variables in computer vision problems. In Proceedings of the Fifth International Conference on Computer Vision (ICCV '95), Boston, June 1995). Two parameters allow one to have a coarse to fine strategy both for resolution and deformation. The authors' technique presents the advantage to minimize a well defined global criterion to deal with various classes of transformations (for example rigid, affine and volume spline), to be simple to implement and to be efficient in practice. Results on real brain and heart 3D images are presented to demonstrate the validity of the authors' approach.","PeriodicalId":436387,"journal":{"name":"Proceedings of the Workshop on Mathematical Methods in Biomedical Image Analysis","volume":"75 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"52","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Workshop on Mathematical Methods in Biomedical Image Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMBIA.1996.534060","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 52

Abstract

Presents a new registration and gain correction algorithm for 3D medical images. It is intensity based. The basic idea is to represent the images by 4D points (x/sub j/, y/sub j/, z/sub j/, i/sub j/) and to define a global energy function based on this representation. For minimization, the authors propose a technique which does not require to compute the derivatives of this criterion with respect to the parameters. It can be understood as an extension of the Iterative Closest Point algorithm (P. Besl and N. McKay, 1992; Z. Zhang, 1992) or as an application of the formalism proposed by L. Cohen (Use of auxiliary variables in computer vision problems. In Proceedings of the Fifth International Conference on Computer Vision (ICCV '95), Boston, June 1995). Two parameters allow one to have a coarse to fine strategy both for resolution and deformation. The authors' technique presents the advantage to minimize a well defined global criterion to deal with various classes of transformations (for example rigid, affine and volume spline), to be simple to implement and to be efficient in practice. Results on real brain and heart 3D images are presented to demonstrate the validity of the authors' approach.
将ICP算法扩展到基于非刚性强度的三维体配准
提出了一种新的三维医学图像配准与增益校正算法。这是基于强度的。基本思想是用4D点(x/sub j/, y/sub j/, z/sub j/, i/sub j/)表示图像,并根据这种表示定义一个全局能量函数。为了最小化,作者提出了一种不需要计算该准则相对于参数的导数的技术。它可以理解为迭代最近点算法的扩展(P. Besl和N. McKay, 1992;Z. Zhang, 1992)或作为L. Cohen提出的形式主义的应用(计算机视觉问题中辅助变量的使用)。第五届计算机视觉国际会议论文集(ICCV '95),波士顿,1995年6月)。两个参数允许一个有一个粗到细的策略,无论是分辨率和变形。作者的技术的优势在于最小化一个定义良好的全局准则来处理各种类型的变换(例如刚性、仿射和体积样条),实现简单,在实践中效率高。在真实的大脑和心脏三维图像上的结果证明了作者方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信