A parallel algorithm for template matching on an SIMD mesh connected computer

An efficient parallel algorithm to compute template matching of an N$0N input image with an M×M template on a single-instruction multiple-data (SIMD) mesh-connected computer with P processors is proposed. The input image is mapped into the processor array such that each processor stores N ²/P data in the cyclic mode. The template values are circulated among the processors instead of being broadcast or stored in the processor memory. There is no movement of the intermediate results. The computation and the communication time complexity of the algorithm is O(M²N²/P) for all P in the range M²⩽P⩽ N²