Minimum Spanning Forests for Morphological Segmentation
Fernand Meyer · Computational imaging and vision · 1994
Cited by 74 works. doi:10.1007/978-94-011-1040-2_11
Authors
References
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Shortest Connection Networks And Some Generalizations
- An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
- Use of watersheds in contour detection
- Segmentation d'images et morphologie mathématique
- Graphs and mathematical morphology
- Graphes et algorithmes
- Letter to the Editor—The Maximum Capacity Route Problem
- The maximum capacity route problem.
- Definition and some properties of the watershed of a continuous function