DocumentCode :
2505843
Title :
Connected components with split and merge
Author :
Kistler, James J. ; Webb, Jon A.
Author_Institution :
Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
fYear :
1991
fDate :
30 Apr-2 May 1991
Firstpage :
194
Lastpage :
201
Abstract :
The split and merge model is a reasonable method for architecture-independent programming of global image processing operations on parallel architectures. The authors consider image connected components from the point of view of this programming model, and develop split and merge algorithms that implement various connected components algorithms that have appeared in the literature. The algorithms are implemented in two architectures independent languages they have developed, namely Apply and Adapt. Performance of the algorithms on the Sun, the Carnegie Mellon Warp, and the Carnegie Mellon Nectar architectures is compared
Keywords :
computer vision; computerised picture processing; merging; parallel programming; Adapt; Apply; Carnegie Mellon Nectar architectures; Carnegie Mellon Warp; architecture-independent programming; global image; image connected components; split and merge model; Computer architecture; Computer languages; Concurrent computing; Data structures; Image processing; Parallel architectures; Parallel programming; Pixel; Programming profession; Sun;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing Symposium, 1991. Proceedings., Fifth International
Conference_Location :
Anaheim, CA
Print_ISBN :
0-8186-9167-0
Type :
conf
DOI :
10.1109/IPPS.1991.153778
Filename :
153778
Link To Document :
بازگشت