PARALLEL ALGORITHMS FOR IMAGE-ENHANCEMENT AND SEGMENTATION BY REGION GROWING, WITH AN EXPERIMENTAL-STUDY

Citation
Da. Bader et al., PARALLEL ALGORITHMS FOR IMAGE-ENHANCEMENT AND SEGMENTATION BY REGION GROWING, WITH AN EXPERIMENTAL-STUDY, Journal of supercomputing, 10(2), 1996, pp. 141-168
Citations number
66
Categorie Soggetti
Computer Sciences","Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture","Computer Science Theory & Methods
Journal title
ISSN journal
09208542
Volume
10
Issue
2
Year of publication
1996
Pages
141 - 168
Database
ISI
SICI code
0920-8542(1996)10:2<141:PAFIAS>2.0.ZU;2-Y
Abstract
This paper presents efficient and portable implementations of a powerf ul image enhancement process, the Symmetric Neighborhood Filter (SNF), and an image segmentation technique that makes use of the SNF and a v ariant of the conventional connected components algorithm which we cal l delta-Connected Components. We use efficient techniques for distribu ting and coalescing data as well as efficient combinations of task and data parallelism. The image segmentation algorithm makes use of an ef ficient connected components algorithm based on a novel approach for p arallel 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, Gray Research T3D, Meiko Scientific CS-2, Intel Paragon, an d workstation clusters. Our experimental results are consistent with t he theoretical analysis (and provide the best known execution times fo r segmentation, even when compared with machine-specific implementatio ns). Our test data include difficult images from the Landsat Thematic Mapper (TM) satellite data.