Parallel Algorithms for Image Template Matching on Hypercube SIMD Computers

Zhixi Fang, Xiaobo Li, Lionel M. Ni

Abstract

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.
BibTeX
@article{fang1987parallel,
  author = {Zhixi Fang and Xiaobo Li and Lionel M. Ni},
  title = {{Parallel Algorithms for Image Template Matching on Hypercube SIMD Computers}},
  journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
  year = {1987},
  doi = {10.1109/tpami.1987.4767990},
}

Loading related content...

Figure