PARALLEL ALGORITHMS FOR MULTIDIMENSIONAL IMAGE TEMPLATE MATCHING

1994 ◽  
pp. 43-50
Author(s):  
A. SAOUDI ◽  
M. NIVAT
Keyword(s):  
Parallel Algorithms ◽  
Template Matching

EFFICIENT PARALLEL ALGORITHMS FOR TEMPLATE MATCHING

2002 ◽  
Vol 12 (03n04) ◽  
pp. 359-364 ◽  
Author(s):  
SANGUTHEVAR RAJASEKARAN
Keyword(s):  
Parallel Algorithms ◽  
Template Matching ◽  
Efficient Algorithms ◽  
Parallel Complexity

The parallel complexity of template matching has been well studied. In this paper we present more work-efficient algorithms than the existing ones. Our algorithms are based on FFT primitives. We consider the following models of computing: PRAM and the hypercube.

PARALLEL ALGORITHMS FOR MULTIDIMENSIONAL IMAGE TEMPLATE MATCHING

1994 ◽  
Vol 08 (02) ◽  
pp. 457-464
Author(s):  
A. SAOUDI ◽  
M. NIVAT
Keyword(s):  
Parallel Algorithms ◽  
Pattern Matching ◽  
Efficient Algorithm ◽  
Template Matching ◽  
Optimal Algorithms ◽  
Pram Model ◽  
Crew Pram ◽  
Multidimensional Array

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

Sign in / Sign up

Export Citation Format

Share Document