Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
A fast globally optimal algorithm for template matching using low-resolution pruning
Autore:
Gharavi-Alkhansari, M;
Indirizzi:
Tarbiat Modarres Univ, Dept Elect Engn, Tehran, Iran Tarbiat Modarres Univ Tehran Iran s Univ, Dept Elect Engn, Tehran, Iran
Titolo Testata:
IEEE TRANSACTIONS ON IMAGE PROCESSING
fascicolo: 4, volume: 10, anno: 2001,
pagine: 526 - 533
SICI:
1057-7149(200104)10:4<526:AFGOAF>2.0.ZU;2-F
Fonte:
ISI
Lingua:
ENG
Keywords:
block matching; exhaustive search; fast algorithms; full search; image search; motion estimation; template matching;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
8
Recensione:
Indirizzi per estratti:
Indirizzo: Gharavi-Alkhansari, M Tarbiat Modarres Univ, Dept Elect Engn, Tehran, IranTarbiat Modarres Univ Tehran Iran n, Tehran, Iran
Citazione:
M. Gharavi-Alkhansari, "A fast globally optimal algorithm for template matching using low-resolution pruning", IEEE IM PR, 10(4), 2001, pp. 526-533

Abstract

Template matching has many applications in signal processing, image processing, pattern recognition, and video compression, This paper proposes a fast coarse-to-fine template matching algorithm for finding the exact best match, i.e., the match. that may be found by a full search. This is obtained by pruning the number of candidates in the full search using the results of a coarse search. Experimental results show that speed ups of a couple of orders of magnitude can easily be achieved using this method for typical low-noise cases of two-dimensional (2-D) template matching.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 29/05/20 alle ore 15:26:30