Share Email Print

Proceedings Paper

Dynamic Processor Allocation For Parallel Algorithms In Image Processing
Author(s): Robert Hummel; Kaizhong Zhang
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Because image processing is numerically intensive, there has been much interest in parallel processing for image analysis applications. While much of low-level vision can be attacked by SIMD mesh-connected architectures, intermediate and high-level vision applications might be able to make effective use of MIMD and distributed architectures. We have taken a standard parallel connected components algorithm, and applied it to image segmentation using an MIMD architecture. The resulting version of the Shiloach/Vishkin algorithm runs on the prototype NYU Ultracomputer. We will describe the implementation and the results of some experiments. We take note of the lesson learned from this implementation: that processor power should be focused dynamically to those portions of the image requiring greatest attention. We then consider the implications of this lesson to other image processing tasks.

Paper Details

Date Published: 21 August 1987
PDF: 8 pages
Proc. SPIE 0754, Optical and Digital Pattern Recognition, (21 August 1987); doi: 10.1117/12.939993
Show Author Affiliations
Robert Hummel, New York University (United States)
Kaizhong Zhang, New York University (United States)

Published in SPIE Proceedings Vol. 0754:
Optical and Digital Pattern Recognition
Hua-Kuang Liu; Paul S. Schenker, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?