Optimal Parallel Algorithms for Multidimensional Image Template Matching and Pattern Matching

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

[1]  W. Rytter,et al.  Parallel algorithms for 2D-image recognition , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. IV. Conference D: Architectures for Vision and Pattern Recognition,.

[2]  Azriel Rosenfeld,et al.  Reducing the expected computational cost of template matching using run length representation , 1990, Pattern Recognit. Lett..

[3]  Azriel Rosenfeld,et al.  Picture languages: Formal models for picture recognition , 1979 .

[4]  Gad M. Landau,et al.  Fast Parallel and Serial Multidimensional Aproximate Array Matching , 1991, Theor. Comput. Sci..