![]() ![]() This algorithm can be considered as an alternative for 2-D full search block matching and it achieves a good computational cost. Three different similarity measures in template matching can be used to compute the likeness between the template and blocks. ![]() The basic idea depends on converting the template and all candidate blocks in the source from 2-D into 1-D. This paper proposes a 1-D template matching algorithm for finding the exact best match for a template image in a source image. Received 4 January 2014 revised 4 February 2014 accepted 15 February 2014 This work is licensed under the Creative Commons Attribution International License (CC BY). ![]() 1College of Computer Science and Information Technology, King Faisal University, Al-Ahsa, KSAĢMathematics Department, Faculty of Science, Mansoura University, Mansoura, EgyptĮmail: © 2014 by author and Scientific Research Publishing Inc. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |