Two-Stage Template Matching
IEEE Transactions on Computers1977Vol. C-26(4), pp. 384–393
Citations Over TimeTop 10% of 1977 papers
Abstract
The computational cost of template matching can be reduced by using only a subtemplate, and applying the rest of the template only when the subtemplate's degree of match exceeds a threshold. A probabilistic analysis of this approach is given, with emphasis on the choice of subtemplate size to minimize the expected computational cost.
Related Papers
- → On the Complexity of Hardness Amplification(2008)10 cited
- → On thin sets of primes expressible as sumsets(2005)2 cited
- → Optimum Pre-Emphasis and De-Emphasis Networks for Transmission of Television by PCM(1964)17 cited
- → The Rényi dimension of a conformal measure for a piecewise monotonic map of the interval(2005)2 cited
- 현대패션에 나타난 Emphasis 표현에 관한 연구(2003)