21 August 1987 Dynamic Processor Allocation For Parallel Algorithms In Image Processing
Author Affiliations +
Proceedings Volume 0754, Optical and Digital Pattern Recognition; (1987) https://doi.org/10.1117/12.939993
Event: OE LASE'87 and EO Imaging Symposium, 1987, Los Angeles, CA, United States
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.
© (1987) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Robert Hummel, Robert Hummel, Kaizhong Zhang, Kaizhong Zhang, } "Dynamic Processor Allocation For Parallel Algorithms In Image Processing", Proc. SPIE 0754, Optical and Digital Pattern Recognition, (21 August 1987); doi: 10.1117/12.939993; https://doi.org/10.1117/12.939993
PROCEEDINGS
8 PAGES


SHARE
Back to Top