摘要
为降低图像匹配模板选取算法的时间复杂度,提出一种基于子图灰度比较编码的图像匹配模板选取算法。首先将子图等分为2×2子块,以子图及邻近区域的4×4子块的灰度比较关系为子图赋予一个编码;其次在所有子图编码中选取重复次数最少的编码对应的一个子图或若干个子图中图像方差最大者作为匹配模板。算法复杂度分析和仿真实验结果表明,该匹配模板选取算法在保证了一定的有效性的前提下,其时间复杂度优于若干常用匹配模板选取准则。
In order to reduce the time of matching template selection,a novel algorithm based on sub-image coding by comparison of gray scale is presented.Firstly,every sub-image was divided into 2×2 blocks equally.Then,by comparing the gray scale of the 4×4 blocks including the sub-image and its neighborhood,an 80-bits-binary-code is given to this sub-image.The next step is to find out the least repeated code and chose the obverse sub-image or the sub-images with the highest image variance as the image matching template.Verified by time analyses and simulation experiments,the aforementioned algorithm has less time complexity than several commonly used algorithms.
出处
《激光与红外》
CAS
CSCD
北大核心
2011年第10期1172-1176,共5页
Laser & Infrared
关键词
图像匹配
模板选取
灰度比较编码
时间复杂度
image matching
template selection
coding by comparison of gray scale
time complexity
