基于压缩感知和尺度不变特征变换的医学图像配准算法

Y. Sa
{"title":"基于压缩感知和尺度不变特征变换的医学图像配准算法","authors":"Y. Sa","doi":"10.1109/ICICTA.2015.140","DOIUrl":null,"url":null,"abstract":"A registration algorithm based on compressive sensing theory and SIFT(Scale-Invariant Feature Transform) is proposed. By the sparse feature representation methods, the feature vector of SIFT is extracted and the high-dimensional gradient derivative is decreased to low-dimensional sparse feature vector. Accordingly, Euclidean distance is introduced to compute the similarity and dissimilarity between feature vectors used for image registration and BBF(Best-Bin-First) data structure is used to avoid exhaustion. The experimental results show that the proposed algorithm has better performance than the traditional SIFT algorithm. Comparing with the current modified SIFT algorithms, the real-time performance of the proposed algorithm is improved obviously.","PeriodicalId":231694,"journal":{"name":"2015 8th International Conference on Intelligent Computation Technology and Automation (ICICTA)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Medical Image Registration Algorithm Based on Compressive Sensing and Scale-Invariant Feature Transform\",\"authors\":\"Y. Sa\",\"doi\":\"10.1109/ICICTA.2015.140\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A registration algorithm based on compressive sensing theory and SIFT(Scale-Invariant Feature Transform) is proposed. By the sparse feature representation methods, the feature vector of SIFT is extracted and the high-dimensional gradient derivative is decreased to low-dimensional sparse feature vector. Accordingly, Euclidean distance is introduced to compute the similarity and dissimilarity between feature vectors used for image registration and BBF(Best-Bin-First) data structure is used to avoid exhaustion. The experimental results show that the proposed algorithm has better performance than the traditional SIFT algorithm. Comparing with the current modified SIFT algorithms, the real-time performance of the proposed algorithm is improved obviously.\",\"PeriodicalId\":231694,\"journal\":{\"name\":\"2015 8th International Conference on Intelligent Computation Technology and Automation (ICICTA)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 8th International Conference on Intelligent Computation Technology and Automation (ICICTA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICTA.2015.140\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 8th International Conference on Intelligent Computation Technology and Automation (ICICTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICTA.2015.140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

提出了一种基于压缩感知理论和SIFT(Scale-Invariant Feature Transform)的配准算法。通过稀疏特征表示方法提取SIFT特征向量,将高维梯度导数降为低维稀疏特征向量。因此,引入欧氏距离来计算图像配准所使用的特征向量之间的相似度和不相似度,并使用Best-Bin-First数据结构来避免耗尽。实验结果表明,该算法比传统的SIFT算法具有更好的性能。与现有的改进SIFT算法相比,该算法的实时性有明显提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Medical Image Registration Algorithm Based on Compressive Sensing and Scale-Invariant Feature Transform
A registration algorithm based on compressive sensing theory and SIFT(Scale-Invariant Feature Transform) is proposed. By the sparse feature representation methods, the feature vector of SIFT is extracted and the high-dimensional gradient derivative is decreased to low-dimensional sparse feature vector. Accordingly, Euclidean distance is introduced to compute the similarity and dissimilarity between feature vectors used for image registration and BBF(Best-Bin-First) data structure is used to avoid exhaustion. The experimental results show that the proposed algorithm has better performance than the traditional SIFT algorithm. Comparing with the current modified SIFT algorithms, the real-time performance of the proposed algorithm is improved obviously.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信