Connected components with split and merge

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.<<ETX>>