This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Parallel Algorithms for Image Template Matching on Hypercube SIMD Machines
June 1989 (vol. 11 no. 6)
pp. 665-669

Efficient parallel algorithms developed on hypercube SIMD (single-instruction multiple data-stream) machines for image template matching are presented. Most of these parallel algorithms are asymptotically optimal in their time complexities. These results improve the known bounds in the literature.

[1] Z. Fang and L. Ni, "Parallel algorithms for 2D convolutions," presented at the IEEE Int. Conf. Parallel Processing, 1986.
[2] Z. Fang, X. Li, and L. M. Ni, "Parallel algorithms for image template matching on hypercube SIMD computers," inProc. IEEE CAPAIDM Workshop, 1985, p. 33.
[3] V. K. Prasanna Kumar and V. Krishnan, "Efficient image template matching on hypercube SIMD arrays," U.S.C. Comput. Res. Inst. Tech. Rep., July 1986.
[4] V. K. Prasanna Kumar and V. Krishnan, "Efficient image template matching on hypercube SIMD arrays," presented at the Int. Conf. Parallel Processing, 1987.
[5] A. Rosenfeld and A. Kak,Digital Picture Processing, New York: Academic, 1976.

Index Terms:
computerised picture processing; computerised pattern recognition; parallel algorithms; image template matching; hypercube SIMD machines; time complexities; bounds; computational complexity; computerised pattern recognition; computerised picture processing; parallel algorithms
Citation:
V.K. Prasanna Kumar, V. Krishnan, "Efficient Parallel Algorithms for Image Template Matching on Hypercube SIMD Machines," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 6, pp. 665-669, June 1989, doi:10.1109/34.24802
Usage of this product signifies your acceptance of the Terms of Use.