Issue No. 06 - June (1989 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.24802
<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>
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
V. Prasanna Kumar and V. Krishnan, "Efficient Parallel Algorithms for Image Template Matching on Hypercube SIMD Machines," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 11, no. , pp. 665-669, 1989.