{"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.