2002
DOI: 10.1007/3-540-47979-1_24
|View full text |Cite
|
Sign up to set email alerts
|

Very Fast Template Matching

Abstract: Template matching by normalized correlations is a common technique for determine the existence and compute the location of a shape within an image. In many cases the run time of computer vision applications is dominated by repeated computation of template matching, applied to locate multiple templates in varying scale and orientation. A straightforward implementation of template matching for an image size n and a template size k requires order of kn operations. There are fast algorithms that require order of n… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
41
0

Year Published

2005
2005
2015
2015

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 78 publications
(41 citation statements)
references
References 8 publications
0
41
0
Order By: Relevance
“…These algorithms differ in terms of the appearance representation used, the number of objects tracked, and the method used to estimate the object motion. A. Yilmaz [3] divided these tracking methods into two subcategories based on the appearance representation used, namely, templates and density-based appearance models [11][12][13][14][15], and multi-view appearance models [16,17].…”
Section: Bii Kernel Trackingmentioning
confidence: 99%
“…These algorithms differ in terms of the appearance representation used, the number of objects tracked, and the method used to estimate the object motion. A. Yilmaz [3] divided these tracking methods into two subcategories based on the appearance representation used, namely, templates and density-based appearance models [11][12][13][14][15], and multi-view appearance models [16,17].…”
Section: Bii Kernel Trackingmentioning
confidence: 99%
“…The sum-table is a precomputed data structure that acts as a lookup table, dramatically reducing the number of multiplications or additions required to evaluate a given expression. More specifically, the sum-table is a discrete version of an integral image [21,22].…”
Section: Fft and Sum-table For Denominator Of Nccmentioning
confidence: 99%
“…given by Equation (21). The results are summarized in Table 1 which compares the sum-table formulation to the FFT and direct formulation of the numerator of Equation (1).…”
Section: Computational Efficiency Examplementioning
confidence: 99%
“…Instead if we approximate the image by a corresponding function the computation can be decreased. Schweitzer et al proposed an efficient template matching algorithm by introducing integral images and approximating the input image with second-or thirdorder polynomials [15].While Shinichiro and Masako Omachi [16] had proposed a fast template matching scheme using Legendre polynomial for approximating the template and then calculating the normalized cross correlation between the input image and sample templates of different sizes. We had considered the work of Shinichiro el al in particular for the task of template matching.…”
Section: Introductionmentioning
confidence: 99%