Algorithms for massively parallel image processing architectures

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The complexity of efficiently programming massively parallel machines is illustrated by presenting a number of new algorithms. These algorithms deal with computational geometry, data histogramming, list manipulation, and other problems or operations that arise in computer vision tasks. All of the algorithms presented use a divide-and-conquer strategy, and they all use routines that solve a problem of size M using a machine of size N, where M < N. In some of the algorithms, the extra processors are used to perform more than M calculations in parallel. In other algorithms, the extra processors are used to improve the speed of interprocessor communication.

Cite

CITATION STYLE

APA

Sanz, J. L. C., & Cypher, R. E. (1988). Algorithms for massively parallel image processing architectures. In Proceedings - International Conference on Pattern Recognition (pp. 412–419). Publ by IEEE. https://doi.org/10.1109/icpr.1988.28256

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free