Hypercube and shuffle-exchange algorithms for image component labeling
References (20)
- et al.
An O(log n) parallel connectivity algorithm
J. Algorithms
(1982) - R. Cypher, J. L. C. Sanz, and L. Snyder, EREW PRAM and mesh connected computer algorithms for image component labeling,...
- R. Cypher, J. L. C. Sanz, and L. Snyder, Practical algorithms for image component labeling on SIMD mesh connected...
- et al.
Approximate and exact parallel scheduling with applications to list, tree, and graph problems
- et al.
Parallelism in random access machines
Connected component labelling in image processing with MIMD architectures
- et al.
Implementing a parallel connected component algorithm on MIMD architectures
- et al.
Parallel Processing of Linear Quadtrees on a Mesh-Connected Computer
- V. K. P. Kumar and M. M. Eshaghian, Parallel geometric algorithms for digitized pictures on mesh of trees (preliminary...
Fast Algorithms for Labeling Connected Components in 2-D Arrays
There are more references available in the full text version of this article.
Cited by (19)
Parallel Labeling of Three-Dimensional Clusters on Networks of Workstations
1998, Journal of Parallel and Distributed ComputingAppendix: Digital topology - A brief introduction and bibliography
1996, Machine Intelligence and Pattern RecognitionParallel cluster labeling for large-scale Monte Carlo simulations
1995, Physica A: Statistical Mechanics and its ApplicationsOptically Interconnected Processor Arrays with Switching Capability
1994, Journal of Parallel and Distributed ComputingDetermining maximum k-width-connectivity on meshes
1993, Computational Geometry: Theory and ApplicationsParallel cluster algorithms
1991, Nuclear Physics B (Proceedings Supplements)
Copyright © 1989 Published by Elsevier Inc.