Multimodal image registration based on SURF and KD tree

Zongyun Gu, Yunxia Yin, Chunming Du
{"title":"Multimodal image registration based on SURF and KD tree","authors":"Zongyun Gu, Yunxia Yin, Chunming Du","doi":"10.1117/12.2035875","DOIUrl":null,"url":null,"abstract":"Aiming at the requirements of multimodal medical image registration for good robustness, high-accuracy and speed, this paper proposes a registration algorithm of multimodal brain medical image based on Speeded-Up Robust Features (SURF) and K-dimension (KD) tree. This algorithm first of all extracts SURF feature points from images and creates feature vector, then build KD tree to complete the image matching, and finally the image registration process is accomplished by estimating space geometric varied parameters according to the matching point pair. The algorithm combines robustness of SURF and high efficiency of improved KD tree. Experimental results show that under the conditions of images with noise, non-uniform intensity and large range of the initial misalignment, the proposed algorithm achieves better robustness, higher speed as well as good registration accuracy.","PeriodicalId":166465,"journal":{"name":"Precision Mechanical Measurements","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Precision Mechanical Measurements","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2035875","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Aiming at the requirements of multimodal medical image registration for good robustness, high-accuracy and speed, this paper proposes a registration algorithm of multimodal brain medical image based on Speeded-Up Robust Features (SURF) and K-dimension (KD) tree. This algorithm first of all extracts SURF feature points from images and creates feature vector, then build KD tree to complete the image matching, and finally the image registration process is accomplished by estimating space geometric varied parameters according to the matching point pair. The algorithm combines robustness of SURF and high efficiency of improved KD tree. Experimental results show that under the conditions of images with noise, non-uniform intensity and large range of the initial misalignment, the proposed algorithm achieves better robustness, higher speed as well as good registration accuracy.
基于SURF和KD树的多模态图像配准
针对多模态医学图像配准对鲁棒性好、精度高、速度快的要求,提出了一种基于加速鲁棒特征(SURF)和k维树(KD)的多模态脑医学图像配准算法。该算法首先从图像中提取SURF特征点并创建特征向量,然后构建KD树完成图像匹配,最后根据匹配点对估计空间几何变化参数完成图像配准过程。该算法结合了SURF的鲁棒性和改进KD树的高效率。实验结果表明,在图像存在噪声、灰度不均、初始偏差范围较大的情况下,该算法具有较好的鲁棒性、较快的配准速度和较好的配准精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信