SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES

DOI10.1142/S0129054103001601zbMath1075.68668OpenAlexW2061163991MaRDI QIDQ5696893

Shi-jinn Horng, Chin-Hsiung Wu

Publication date: 19 October 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054103001601

zbMATH Keywords

image processingparallel algorithmstemplate matchingpipelined optical bus systems

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Parallel algorithms in computer science (68W10)

Cites Work

• Optimal parallel algorithms for computer vision problems
• INTEGER SORTING AND ROUTING IN ARRAYS WITH RECONFIGURABLE OPTICAL BUSES
• On the communication complexity of generalized 2-D convolution on array processors
• Parallel Processing Approaches to Image Correlation
• Constant Time Algorithm for Template Matching on a Reconfigurable Array of Processors
• MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗
• Efficient parallel algorithms for hierarchical clustering on arrays with reconfigurable optical buses

This page was built for publication: SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES