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
Published in:
Pattern Analysis and Machine Intelligence, IEEE Transactions on
(Volume:11
,
Issue:
6
)
Date of Publication: Jun 1989