Paper Info
Title
Connected components with split and merge
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.
Year
DOI
Venue
1991
10.1109/IPPS.1991.153778
Anaheim, CA
Keywords
Field
DocType
computer vision,programming model,image processing,parallel programming,merging,connected component
Merge algorithm,Programming paradigm,Computer science,Parallel computing,Image processing,Connected component,Merge (version control)
Conference
ISBN
Citations 
PageRank 
0-8186-9167-0
4
0.50
References 
Authors
7
2
Name
Order
Citations
PageRank
James J. Kistler1673192.53
Jon A. Webb2371185.61