Efficient parallel algorithms for image template matching on hypercube SIMD machines
From MaRDI portal
Recommendations
- Image template matching on hypercube SIMD computers
- Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory
- Faster image template matching in the sum of the absolute value of differences measure
- SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES
- scientific article; zbMATH DE number 49825
Cited in
(15)- Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory
- 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
- Replicated data algorithms in image processing
- New and efficient cellular algorithms for image processing
- scientific article; zbMATH DE number 49825 (Why is no real title available?)
- Constant Time Algorithm for Template Matching on a Reconfigurable Array of Processors
- scientific article; zbMATH DE number 1780169 (Why is no real title available?)
- Computing a complete histogram of an image in (n) steps and minimum expected memory requirements using hypercubes
- Computing Hough transforms on hypercube multicomputers
- SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES
- A simplified design strategy for mapping image processing algorithms on a SIMD torus
- Image template matching on hypercube SIMD computers
- Two image-template operations for binary image processing.
This page was built for publication: Efficient parallel algorithms for image template matching on hypercube SIMD machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4732114)