Formulation of parallel image processing tasks

Authors:
S Yalamanchili;J.K Aggarwal
Affiliations:
Laboratory for Image and Signal Analysis, Department of Electrical Engineering, The University of Texas at Austin, Austin, TX 78712, USA;Laboratory for Image and Signal Analysis, Department of Electrical Engineering, The University of Texas at Austin, Austin, TX 78712, USA
Venue:
Pattern Recognition Letters
Year:
1984

Citing 4
Cited 0

The NP-completeness column: An ongoing guide

Journal of Algorithms
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Communication Issues in the Design and Analysis of Parallel Algorithms

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.10

Visualization

Abstract

An increasing awareness of the need for high speed parallel processing systems for image analysis has stimulated a great deal of interest in the study of such systems. These studies have focussed primarily on specific algorithms and while they demonstrated the utility of such an approach, few general principles have evolved. As a result, it is still uncertain how one may go about addressing a given application. This paper first presents techniques for formulating parallel image processing tasks by focussing on one or more components of an image processing environment. Then a parallel processing model is proposed which specifies the interaction among tasks formulated in this manner. The techniques and model enable one to determine constraints on architectural features required to achieve predefined performance levels and compare and contrast different formulations.