Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory

DOI10.1016/0020-0190(91)90211-YzbMath0736.68084OpenAlexW2066116497MaRDI QIDQ1178193

Wen-Tsuen Chen, Ming-Yi Fang, Shi-jinn Horng

Publication date: 26 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90211-y

zbMATH Keywords

computer visionsignal processingGray code mappingoptimal speed-up ratio

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10)

Cites Work

• Generalized Hypercube and Hyperbus Structures for a Computer Network
• On the communication complexity of generalized 2-D convolution on array processors
• Parallel Processing Approaches to Image Correlation
• Efficient parallel algorithms for some graph problems

This page was built for publication: Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory