A dual-bound algorithm for very fast and exact template matching

Recently proposed fast template matching techniques employ rejection schemes derived from lower bounds on the match measure. This paper generalizes that idea and shows that in addition to lower bounds, upper bounds on the match measure can be used to accelerate the search. An algorithm is proposed t...

Description complète

Détails bibliographiques

Publié dans:	IEEE transactions on pattern analysis and machine intelligence. - 1979. - 33(2011), 3 vom: 17. März, Seite 459-70
Auteur principal:	Schweitzer, Haim (Auteur)
Autres auteurs:	Deng, Rui April, Anderson, Robert Finis
Format:	Article en ligne
Langue:	English
Publié:	2011
Accès à la collection:	IEEE transactions on pattern analysis and machine intelligence
Sujets:	Comparative Study Journal Article