Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Faster image template matching in the sum of the absolute value of differences measure
Autore:
Atallah, MJ;
Indirizzi:
Purdue Univ, CERIAS, W Lafayette, IN 47907 USA Purdue Univ W Lafayette INUSA 47907 v, CERIAS, W Lafayette, IN 47907 USA Purdue Univ, Dept Comp Sci, W Lafayette, IN 47907 USA Purdue Univ W Lafayette IN USA 47907 Comp Sci, W Lafayette, IN 47907 USA
Titolo Testata:
IEEE TRANSACTIONS ON IMAGE PROCESSING
fascicolo: 4, volume: 10, anno: 2001,
pagine: 659 - 663
SICI:
1057-7149(200104)10:4<659:FITMIT>2.0.ZU;2-5
Fonte:
ISI
Lingua:
ENG
Soggetto:
COMPUTER;
Keywords:
algorithms; convolution; image professing; template matching;
Tipo documento:
Letter
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
14
Recensione:
Indirizzi per estratti:
Indirizzo: Atallah, MJ Purdue Univ, CERIAS, W Lafayette, IN 47907 USA Purdue Univ W Lafayette IN USA 47907 Lafayette, IN 47907 USA
Citazione:
M.J. Atallah, "Faster image template matching in the sum of the absolute value of differences measure", IEEE IM PR, 10(4), 2001, pp. 659-663

Abstract

Given an m x m image I and a smaller m x n image P, the computation of an (m - n + 1) X (m - n + 1) matrix C where C(i, j) is of the formC(i, j) = Sigma (n-1)(k=0) Sigma (n-1)(k ' =0) f(I(i + k, j + k '), P(k, k')),0 less than or equal toi, j less than or equal to m - nfor some function f, is often used in template matching. Frequent choices for the function f are f(x, y) = (x - y)(2) and f(x, y) = \x - y\. For the case when f(x, y) = (x - y)(2), it is well known that C is computable in O(m(2) log n) time. For the case f(a:, y) = la: - yl, on the other hand, the brute force O((m - n + 1)(2)n(2)) time algorithm for computing C seems to be the best known. This paper gives an asymptotically Easter algorithm for computing C when f(x, y) = \x - y\, one that runs in time O(min{s, n/root logn}m(2) log n) time, where s is the size of the alphabet, i.e., the number of distinct symbols that appear in I and P. This is achieved by combining two algorithms, one of which runs in O(sm(2) log n) time, the other in O(m(2)n root log n) time. We also give a simple Monte Carlo algorithm that runs in O(m(2) log n) time and gives unbiased estimates of C.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 05/04/20 alle ore 13:35:17