Abstract：This paper proposes a novel parallel algorithm for template matching of image division block based on a K-ary 2-cube network SIMD computer. For the template matching on an N by N image, M by M template and K by K processing unit array (M < K, N = BK, B > 1), the algorithm is able to realize template matching by dividing an image into blocks. Compared with known algorithms, the algorithm is able to process an image whose size is larger than that of the processing unit.
2001, Vol. 23 
