A quadtree algorithm for template matching on a pyramid computer

DOI10.1016/0304-3975(94)00020-JMaRDI QIDQ1349703zbMATH OpenFDO

Authors H. Senoussi, Ahmed Saoudi

Publication date 27 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory
• SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES
• Faster image template matching in the sum of the absolute value of differences measure
• Efficient parallel algorithms for image template matching on hypercube SIMD machines
• scientific article; zbMATH DE number 2062506

Cites work

• scientific article; zbMATH DE number 3900665 (Why is no real title available?)
• A quadtree algorithm for template matching on a pyramid computer
• An effective way to represent quadtrees
• Image template matching on hypercube SIMD computers

Cited in

(9)

• Faster image template matching in the sum of the absolute value of differences measure
• Analysis of a steepest-descent image-matching algorithm
• Constant Time Algorithm for Template Matching on a Reconfigurable Array of Processors
• The \(3^{*}\)-connected property of pyramid networks
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• Proof that pyramid networks are 1-Hamiltonian-connected with high probability
• A quadtree algorithm for template matching on a pyramid computer
• Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.

This page was built for publication: A quadtree algorithm for template matching on a pyramid computer

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