The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (1989 vol.11)
pp: 665-669
ABSTRACT
<p>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.</p>
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 & Machine Intelligence, vol.11, no. 6, pp. 665-669, June 1989, doi:10.1109/34.24802
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool