The Community for Technology Leaders
Green Image
Issue No. 06 - June (1987 vol. 9)
ISSN: 0162-8828
pp: 835-841
Zhixi Fang , Department of Computer Science, Wichita State University, Wichita, KS 67208.
Xiaobo Li , Department of Computer Science, University of Alberta, Edmonton, Alta. T6G 2H1, Canada.
Lionel M. Ni , Department of Computer Science, Michigan State University, East Lansing, MI 48824.
This correspondence presents several parallel algorithms for image template matching on an SIMD array processor with a hypercube interconnection network. For an N by N image and an M by M window, the time complexity is reduced from O(N2M2) for the serial algorithm to O(M2/K2 + M * log2 N/K + log2 N * log2 K) for the N2K2-PE system (1 ¿ K ¿ M), or to O(N2M2/L2) for the L2-PE system (L ¿ N). With efficient use of the inter-PE communication network, each PE requires only a small local memory, many unnecessary data transmissions are eliminated, and the time complexity is greatly reduced.

L. M. Ni, Z. Fang and X. Li, "Parallel Algorithms for Image Template Matching on Hypercube SIMD Computers," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 9, no. , pp. 835-841, 1987.
89 ms
(Ver 3.3 (11022016))