Two-Stage Template Matching

  • Authors:
  • G. J. Vanderbrug;A. Rosenfeld

  • Affiliations:
  • Computer Science Center, University of Maryland;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1977

Quantified Score

Hi-index 14.98

Visualization

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.