Connected Components with Split and Merge
Conference Paper, Proceedings of 5th International Parallel Processing Symposium, pp. 194 - 201, April, 1991
Abstract
The split and merge model is a reasonable method for architecture-independent programming of global image processing operations on parallel architectures. We 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 we have developed, namely Apply and Adapt. Performance of the algorithms on the Sun, the Carnegie Mellon Warp, and the Camegie Mellon Nectar architectures is compared.
BibTeX
@conference{Kistler-1991-13241,author = {James J. Kistler and Jon A. Webb},
title = {Connected Components with Split and Merge},
booktitle = {Proceedings of 5th International Parallel Processing Symposium},
year = {1991},
month = {April},
pages = {194 - 201},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.