Computation of Watersheds Based on Parallel Graph Algorithms.
Arnold MeijsterJos B. T. M. RoerdinkPublished in: ISMM (1996)
Keyphrases
- graph theory
- depth first search
- linear algebra
- computational complexity
- significant improvement
- data structure
- optimization problems
- computationally efficient
- structured data
- graph search
- parallel implementations
- partitioning algorithm
- maximum flow
- watershed segmentation
- parallel architectures
- minimum spanning tree
- graph structure
- parallel processing
- random walk
- computational cost