Issue No. 04 - April (1977 vol. 26)
G.J. Vanderbrug , Computer Science Center, University of Maryland
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.
Computational cost, pattern recognition, picture processing, subtemplate, template matching.
A. Rosenfeld and G. Vanderbrug, "Two-Stage Template Matching," in IEEE Transactions on Computers, vol. 26, no. , pp. 384-393, 1977.