摘要:This paper proposes a 1-D template matching algorithm for finding the exact best match for a template image in a source image. The basic idea depends on converting the template and all candidate blocks in the source from 2-D into 1-D. Three different similarity measures in template matching can be used to compute the likeness between the template and blocks. This algorithm can be considered as an alternative for 2-D full search block matching and it achieves a good computational cost. Complexity analysis and experimental results show that the performance of the proposed is superior to that of other basic template matching algorithms.