Document Type
Article
Date
1994
Keywords
region growing, split and merge, parallel processing, data parallelism, message passing, connection machine
Language
English
Disciplines
Computer Sciences
Description/Abstract
Region growing is a general technique for image segmentation, where image characteristics are used to group adjacent pixels together to form regions. This paper presents a parallel algorithm for solving the region growing problem based on the split and merge approach, and uses it to test and compare various parallel architectures and programming models. The implementations were done on the Connection Machine, models CM-2 and CM-5, in the data parallel and message passing programming models. Randomization was introduced in breaking ties during merging to increase the degree of parallelism, and only one and two-dimensional arrays of data were used in the implementations.
Recommended Citation
Copty, Nawal; Ranka, Sanjay; Fox, Geoffrey C.; and Shankar, Ravi V., "A Data Parallel Algorithm for Solving the Region Growing Problem on the Connection Machine" (1994). College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects. 16.
https://surface.syr.edu/lcsmith_other/16
Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.
