JOURNAL ARTICLE
EFFICIENT PARALLEL ALGORITHMS FOR TEMPLATE MATCHING
Year: 2002 Journal: Parallel Processing Letters Vol: 12 (03n04)Pages: 359-364 Publisher: World Scientific
Abstract
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.
Keywords:
Computer science Hypercube Parallel algorithm Parallel computing Fast Fourier transform Matching (statistics) Algorithm Analysis of parallel algorithms Parallel processing Computational complexity theory Theoretical computer science Mathematics
Metrics
3
Cited By
0.00
FWCI (Field Weighted Citation Impact)
0
Refs
0.13
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Algorithms and Data Compression
Physical Sciences → Computer Science → Artificial Intelligence
Graph Theory and Algorithms
Physical Sciences → Computer Science → Computer Vision and Pattern Recognition
Network Packet Processing and Optimization
Physical Sciences → Computer Science → Hardware and Architecture
Related Documents
JOURNAL ARTICLE
Efficient parallel algorithms for image template matching on hypercube SIMD machines
K.V.K. PrasannaVenkata Krishnan
Journal: IEEE Transactions on Pattern Analysis and Machine Intelligence Year: 1989 Vol: 11 (6)Pages: 665-669
JOURNAL ARTICLE
PARALLEL ALGORITHMS FOR MULTIDIMENSIONAL IMAGE TEMPLATE MATCHING
Journal: Series in machine perception and artificial intelligence Year: 1994 Vol: 08 (02)Pages: 43-50
BOOK-CHAPTER
Optimal parallel algorithms for multidimensional image template matching and pattern matching
Lecture notes in computer science Year: 1992 Pages: 240-246
JOURNAL ARTICLE
Efficient Algorithms for Image Template and Dictionary Matching
Journal: Journal of Mathematical Imaging and Vision Year: 2000 Vol: 12 (1)Pages: 81-90