A Fast Matching Algorithm Based on K-Degree Template
To improve the correctness and real-time performance in the process of image matching, this paper proposed a fast matching algorithm based on image K-graydegree clustering. Given a template with irregular shape, this algorithm divides the image into certain size blocks called R_block, and calculates their mean gray value, then clusters original templates to K-degree templates according to gray distribution of matching targets. At the same time the algorithm cluster the divided template to a K-degree template Tk and create a K-degree template set based on Tk, then matching these Kdegree templates into the searching image from coarse to fine. In the process of coarse matching, it only needs to check whether corresponding blocks between template and sub-image are in the same degree. In the process of fine matching, the algorithm makes it possible for efficient matching of a template into an image based on the improved NCC formula, which is based on differential ordinal array, this reduces multiplication significantly. Experiments show that this algorithm is robust and fast under the condition of non-linear changing of local lighting, noise, target matching of irregular shape, and even matching in complex background.
image processing template matching K-value template
Sha Sha Chen Jianer Luo Sanding
School of information science and engineering Central South University Changsha, China
国际会议
第四届国际计算机新科技与教育学术会议(2009 4th International Conference on Computer Science & Education)
南京
英文
1967-1971
2009-07-25（万方平台首次上网日期，不代表论文的发表时间）