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
LEADER 01000caa a22002652c 4500
001 NLM198177682
003 DE-627
005 20250211140003.0
007 cr uuu---uuuuu
008 231223s2011 xx |||||o 00| ||eng c
024 7 |a 10.1109/TPAMI.2010.105  |2 doi 
028 5 2 |a pubmed25n0661.xml 
035 |a (DE-627)NLM198177682 
035 |a (NLM)20479491 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Schweitzer, Haim  |e verfasserin  |4 aut 
245 1 2 |a A dual-bound algorithm for very fast and exact template matching 
264 1 |c 2011 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 23.06.2011 
500 |a Date Revised 21.04.2011 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a 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 that utilizes both lower and upper bounds to detect the k best matches in an image. The performance of this dual-bound algorithm is guaranteed; it always detects the k best matches. Theoretical analysis and experimental results show that its runtime compares favorably with previously proposed real-time exact template-matching schemes 
650 4 |a Comparative Study 
650 4 |a Journal Article 
700 1 |a Deng, Rui April  |e verfasserin  |4 aut 
700 1 |a Anderson, Robert Finis  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 33(2011), 3 vom: 17. März, Seite 459-70  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnas 
773 1 8 |g volume:33  |g year:2011  |g number:3  |g day:17  |g month:03  |g pages:459-70 
856 4 0 |u http://dx.doi.org/10.1109/TPAMI.2010.105  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 33  |j 2011  |e 3  |b 17  |c 03  |h 459-70