Abstract
This paper presents efficient and portable implementations of a useful image enhancement process, the Symmetric Neighborhood Filter (SNF), and an image segmentation technique which makes use of the SNF and a variant of the conventional connected components algorithm which we call δ-Connected Components. We use efficient techniques for distributing and coalescing data as well as efficient combinations of task and data parallelism. The image segmentation algorithm makes use of an efficient connected components algorithm based on a novel approach for parallel merging. The algorithms have been coded in SPLIT-C and run on a variety of platforms, including the Thinking Machines CM-5, IBM SP-1 and SP-2, Cray Research T3D, Meiko Scientific CS-2, Intel Paragon, and workstation clusters. Our experimental results are consistent with the theoretical analysis (and provide the best known execution times for segmentation, even when compared with machine-specific implementations.) Our test data include difficult images from the Landsat Thematic Mapper (TM) satellite data.
Original language | English (US) |
---|---|
Pages (from-to) | 414-423 |
Number of pages | 10 |
Journal | IEEE Symposium on Parallel and Distributed Processing - Proceedings |
State | Published - 1996 |
Externally published | Yes |
Event | Proceedings of the 1996 10th International Parallel Processing Symposium - Honolulu, HI, USA Duration: Apr 15 1996 → Apr 19 1996 |
All Science Journal Classification (ASJC) codes
- General Engineering