Two-Stage Template Matching

1 April 1977

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-26 (4) , 384-393
https://doi.org/10.1109/tc.1977.1674847

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.

Keywords

This publication has 6 references indexed in Scilit:

The Representation and Matching of Pictorial Structures
IEEE Transactions on Computers, 1973
A Class of Algorithms for Fast Digital Image Registration
IEEE Transactions on Computers, 1972
Ordered search techniques in template matching
Proceedings of the IEEE, 1972
Edge and Curve Detection for Visual Scene Analysis
IEEE Transactions on Computers, 1971
Recognition system design by statistical analysis
Published by Association for Computing Machinery (ACM) ,1964
Alpha-numeric character recognition using local operations
Published by Association for Computing Machinery (ACM) ,1959