检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:蔡欣展 刘艳艳 CAI Xinzhan;LIU Yanyan(Key Laboratory of Photoelectronic Thin Film Devices and Technology of Tianjin,School of Electronic Information and Optical Engineering,Nankai University,Tianjin 300350,CHN)
机构地区:[1]南开大学电子信息与光学工程学院天津市光电子薄膜器件与技术重点实验室,天津300350
出 处:《半导体光电》2020年第6期875-878,共4页Semiconductor Optoelectronics
摘 要:针对传统Harris角点检测算法的图像配准过程计算量大、速度慢等问题,提出一种快速预筛选Harris角点检测算法。首先通过FAST算法快速排除大量非特征点,再通过抑制半径解决FAST角点聚簇现象,然后在FAST角点邻域内筛选出Harris角点,最后采用Brute-Force匹配方式得到精准匹配。实验结果表明:所提改进算法不仅提高了角点检测速度而且减少了冗余角点数量,在图像配准过程中有效提高了配准速度与精度,配准效果良好。Aiming at the problems of large amount of calculation and slow speed in the process of image registration for traditional Harris corner detection algorithm,in this paper,a fast pre-screening Harris corner detection algorithm was proposed.Firstly,a large number of non-feature points were quickly eliminated with the FAST algorithm,and then the clustering of FAST corners was solved by suppressing the radius.Secondly, Harris corners in the neighborhood of FAST corners were selected,and finally Brute-Force matching was used to realize accurate matching.Experimental results show that the proposed algorithm not only improves the corner detection speed but also reduces the number of redundant corners,and it effectively improves the registration speed and accuracy,realizing agood registration effect.
关 键 词:HARRIS角点 FAST算法 抑制半径 Brute-Force匹配
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.116