Karhünen-loève transform: An exercise in simple image-processing parallel pipelines

6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Practical parallelizations of multi-phased low-level image-processing algorithms may require working in batch mode. The features of a common processing model, employing a pipeline of processor farms, are described. A simple exemplar, the Karhünen-Loève transform, is prototyped on a network of processors running a real-time operating system. The design trade-offs for this and similar algorithms are indicated, when a general solution is sought. Eventual implementation on large- and fine-grained hardware is considered. The chosen exemplar is shown to have some features, such as strict sequencing and unbalanced processing phases, which militate against a comfortable parallelization.

Cite

CITATION STYLE

APA

Fleury, M., Downton, A. C., & Clark, A. F. (1997). Karhünen-loève transform: An exercise in simple image-processing parallel pipelines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1300 LNCS, pp. 815–819). Springer Verlag. https://doi.org/10.1007/bfb0002818

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