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