DocumentCode
2570868
Title
Fixed time template matching
Author
Anderson, Robert Finis ; Schweitzer, Haim
Author_Institution
Dept. of Comput. Sci., Univ. of Texas at Dallas, Richardson, TX, USA
fYear
2009
fDate
11-14 Oct. 2009
Firstpage
1359
Lastpage
1364
Abstract
The problem of finding a match for an image (`template´) within a larger image is known as template matching. It is key to a variety of computer vision applications. Currently known template matching algorithms run in fixed time, or are guaranteed to find the best match. We present a novel algorithm which in many cases can guarantee that the best match is found. In other cases it finds a good approximation to the best match. This algorithm runs in fixed time (a.k.a. hard real time). It finds an optimal match very quickly when a good match exists.
Keywords
computer vision; image matching; computer vision; fixed time template matching; image matching; machine vision; Acceleration; Application software; Computer science; Computer vision; Cybernetics; Machine vision; Optimal matching; Runtime; Time measurement; USA Councils; Machine Vision; Machine Vision Applications; Real Time; Template Matching;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man and Cybernetics, 2009. SMC 2009. IEEE International Conference on
Conference_Location
San Antonio, TX
ISSN
1062-922X
Print_ISBN
978-1-4244-2793-2
Electronic_ISBN
1062-922X
Type
conf
DOI
10.1109/ICSMC.2009.5346256
Filename
5346256
Link To Document