PARALLEL ALGORITHMS FOR MULTIDIMENSIONAL IMAGE TEMPLATE MATCHING

Abstract

This paper presents efficient and optimal parallel algorithms for multidimensional image template matching on CREW PRAM model. For an N d image and an M d window, we present an optimal (respectively efficient) algorithm which runs in O(log(M)) time with O(M d ×N d /log(M) processors (respectively O(M d ×N d )). We also present efficient and optimal algorithms for solving the multidimensional array and pattern matching.