Image template matching on hypercube SIMD computers

DOI10.1016/0165-1684(90)90026-UMaRDI QIDQ804329zbMATH OpenOpenAlexFDO

Authors J. I. Benavides, O. Plata, E. L. Zapata, Francisco F. Rivera, J. M. Carazo

Publication date 1990

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0165-1684(90)90026-u

zbMATH Keywords

hypercube computersimage processingimage template matchingparallel algorithm

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Distributed algorithms (68W15)

Review text

We present a parallel algorithm to perform an image template matching (PITM) on SIMD hypercube computers with non-shared local memory. This parallel algorithm is general in the sense that it allows for arbitrary dimensions for the image, the template and the hypercube. The flexibility of the PITM algorithm is rooted in the partition of the dimensions of the hypercube into four subsets, each one associated with one independent loop of the sequential algorithm (template matching in the domain of the time), and in the way the data are distributed in the local memories of the processing elements (consecutive storage for the template and for the matrix of cross-correlation coefficients, and shifted-consecutive for the image). Both the algorithmic complexity and the data redundancy are analyzed.

Recommendations

• Efficient parallel algorithms for image template matching on hypercube SIMD machines
• Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory
• Fast computation of variant templates for parallel image processing
• scientific article; zbMATH DE number 1844555
• scientific article; zbMATH DE number 49825

Cited in

(12)

• Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory
• Distributed evaluation of an iterative function for all object pairs on an SIMD hypercube
• A quadtree algorithm for template matching on a pyramid computer
• Parallel image correlation: Case study to examine trade-offs in algorithm-to-machine mappings
• Fast computation of variant templates for parallel image processing
• A parallel image matching algorithm based on entropy feature vector
• scientific article; zbMATH DE number 49825 (Why is no real title available?)
• A PARALLEL ALGORITHM FOR HOUSEHOLDER'S TRID1AGONALIZATION OF A SYMMETRIC MATRIX
• scientific article; zbMATH DE number 1780169 (Why is no real title available?)
• Efficient parallel algorithms for image template matching on hypercube SIMD machines
• A simplified design strategy for mapping image processing algorithms on a SIMD torus
• Two image-template operations for binary image processing.

This page was built for publication: Image template matching on hypercube SIMD computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804329)