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