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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on pattern analysis and machine intelligence. - 1979. - 33(2011), 3 vom: 17. März, Seite 459-70
1. Verfasser:	Schweitzer, Haim (VerfasserIn)
Weitere Verfasser:	Deng, Rui April, Anderson, Robert Finis
Format:	Online-Aufsatz
Sprache:	English
Veröffentlicht:	2011
Zugriff auf das übergeordnete Werk:	IEEE transactions on pattern analysis and machine intelligence
Schlagworte:	Comparative Study Journal Article