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.
Gray-Scale Image Colorization Using Various Affinity Functions