Paper
1 July 1990 Fast parallel algorithms: from images to level sets and labels
H. T. Nguyen, Ken K. Jung, Raghu Raghavan
Author Affiliations +
Proceedings Volume 1246, Parallel Architectures for Image Processing; (1990) https://doi.org/10.1117/12.19577
Event: Electronic Imaging: Advanced Devices and Systems, 1990, Santa Clara, CA, United States
Abstract
Decomposition into level sets refers to assigning a code with respect to intensity or elevation while labeling refers to assigning a code with respect to disconnected regions. We present a sequence of parallel algorithms for these two processes. The process of labeling includes re-assign labels into a natural sequence and compare different labeling algorithm. We discuss the difference between edge-based and region-based labeling. The speed improvements in this labeling scheme come from the collective efficiency of different techniques. We have implemented these algorithms on an in-house built Geometric Single Instruction Multiple Data (GSIMD) parallel machine with global buses and a Multiple Instruction Multiple Data (MIMD) controller. This allows real time image interpretation on live data at a rate that is much higher than video rate. The performance figures will be shown.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
H. T. Nguyen, Ken K. Jung, and Raghu Raghavan "Fast parallel algorithms: from images to level sets and labels", Proc. SPIE 1246, Parallel Architectures for Image Processing, (1 July 1990); https://doi.org/10.1117/12.19577
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image processing

Binary data

Image segmentation

Detection and tracking algorithms

Image processing algorithms and systems

Parallel computing

Parallel processing

RELATED CONTENT


Back to Top