Optimal parallel algorithms for computer vision problems

DOI10.1006/JPDC.2001.1821MaRDI QIDQ701158zbMATH OpenOpenAlexFDO

Authors Chin-Hsiung Wu, Horng-Ren Tsai, Shi-Jinn Horng

Publication date 16 October 2002

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.2001.1821

zbMATH Keywords

Hough transformmedian rowreconfigurable optical buses

Mathematics Subject Classification ID

Machine vision and scene understanding (68T45) Parallel algorithms in computer science (68W10)

Recommendations

• SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES
• Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
• Parallel matching and reconstruction algorithms in computer vision
• Constant-time Hough transform on the processor arrays with reconfigurable bus systems
• Parallel algorithm for computing shape's moments on arrays with reconfigurable optical buses

Cited in

(7)

• Parallel matching and reconstruction algorithms in computer vision
• Computing optimised parallel speeded-up robust features (P-SURF) on multi-core processors
• Parallel algorithm for computing shape's moments on arrays with reconfigurable optical buses
• Optimization for computer vision. An introduction to core concepts and methods
• scientific article; zbMATH DE number 1203277 (Why is no real title available?)
• scientific article; zbMATH DE number 2104060 (Why is no real title available?)
• SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES

This page was built for publication: Optimal parallel algorithms for computer vision problems

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