首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于点的快速图像配准算法
引用本文:郑雪梅,范勇,石琦凯,柴立群,王俊波.一种基于点的快速图像配准算法[J].计算机工程,2012,38(1):220-221,224.
作者姓名:郑雪梅  范勇  石琦凯  柴立群  王俊波
作者单位:1. 西南科技大学计算机科学与技术学院,四川绵阳,621010
2. 中国工程物理研究院激光聚变研究中心,四川绵阳,621010
3. 西南科技大学理学院,四川绵阳,621010
基金项目:国家自然科学基金-中国工程物理研究院联合基金资助项目(10676029,10776028)
摘    要:提出一种基于点的快速配准算法。该算法在特征点提取时采用加速分段测试特征算法,通过对比度纹理直方图对特征点进行描述。为加快算法的匹配速度,选用最优节点优先算法进行查找。同时为提高匹配算法的鲁棒性,利用随机抽样一致性算法去除误匹配点对。实验结果表明,与经典的SIFT算法和SURF算法相比,该算法在保持算法稳定性能的同时,可有效提高匹配速度。

关 键 词:加速分段测试特征  对比度纹理直方图  K-D树  最优节点优先  随机抽样一致性
收稿时间:2011-05-30

Fast Image Registration Algorithm Based on Points
ZHENG Xue-mei , FAN Yong , SHI Qi-kai , CHAI Li-qun , WANG Jun-bo.Fast Image Registration Algorithm Based on Points[J].Computer Engineering,2012,38(1):220-221,224.
Authors:ZHENG Xue-mei  FAN Yong  SHI Qi-kai  CHAI Li-qun  WANG Jun-bo
Affiliation:1a.School of Computer Science and Technology;1b.School of Sciences,Southwest University of Science and Technology,Mianyang 621010,China;2.Research Center of Laser Fusion,China Academy of Engineering Physics,Mianyang 621010,China)
Abstract:A fast registration algorithm based on points is presented.Features from Accelerated Segment Test(FAST) is adopted to extract feature points.Contrast Context Histogram(CCH) is exploited to describe feature points.Best Bin First(BBF) searching algorithm is used to accelerate matching.To improve the robustness of the algorithm,Random Sample Consensus(RANSAC) is utilized to remove the mismatched points.Experimental results show that,compared with other registration algorithm such as SIFT and SURF,the proposed algorithm increases the speed observably while keeping the stability of the algorithm.
Keywords:Features from Accelerated Segment Test(FAST)  Contrast Context Histogram(CCH)  K-D tree  Best Bin First(BBF)  Random Sample Consensus(RANSAC)
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号