Affiliation:
1. Southeast University
2. Nanjing Institute of Technology
Abstract
One classic algorithm usedin template matching is normalized cross correlation method. It often achieveshigh precision. But it does not meet speed requirements for time-criticalapplications. To solve that issue, a speed-up way of template matching isproposed. The fast matching way bases on pyramid hierarchical searchingalgorithm. It adopts two template matching methods to match images, which baseon rough matching proceeds local matching precision. Firstly, the coarsematching is performed based on gray-scale projection algorithm. Secondly, theprecise matching is made based on several small block matching. The new way iscompared to conventional approach without pyramid hierarchical searching byexperiments. Experimental result demonstrates that the proposed way efficientlyimproves the speed of template matching and the precision is unchanged.
Publisher
Trans Tech Publications, Ltd.
Reference9 articles.
1. Hung Y Y, Lin L, Park B G.: Practical 3D computer vision techniques for full-field surface measurement, Optical Engineering, 2000, 39(1): 143-149.
2. Liu J W, Liang J, Liang X H, et al.: Industrial vision measuring system for large dimension work-pieces, Opt. Precision Eng., 2010, 18(1): 126-134. (in Chinese).
3. R. Tjahyadi, W. Liu et al.: Face Recognition Based on Ordinal Correlation, Int. J. Intell. Syst. Technol Appl. 3(3/4), 226–240 (2007).
4. D. Tsai, C. Lin: Fast Normalized Cross Correlation for Defect Detection, Pattern Recognit. Lett. 24(15), 2625–2631 (2003).
5. O Neill M, Denos M.: Automated System for Coarse-to-Fine Pyramidal Area Correlation Stereo Matching, Image and Vision Computing, 1996, 14( 3) : 225-236.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献