Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle

By J. Cousty, Gilles Bertrand, Laurent Najman, M. Couprie. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2009

365 citations recorded by the source corpus.

Subfields: Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition, Ocean Engineering

View Paper: https://www.semanticscholar.org/paper/e3fcdb1967039f7c5debbf1ff519ed706c6c748c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Graphics and Computer-Aided Design

1. Robin Strand
2. H. Sebastian Seung
3. Gunilla Borgefors
4. Srinivas C. Turaga
5. Punam Kumar Saha
6. Viren Jain

In Computer Vision and Pattern Recognition

1. Punam Kumar Saha
2. Robin Strand
3. Viren Jain
4. H. Sebastian Seung
5. Gunilla Borgefors
6. Srinivas C. Turaga
7. Luc Van Gool
8. Xiaogang Wang

In Ocean Engineering

1. Robin Strand
2. Gunilla Borgefors
3. Punam Kumar Saha

Citations in the corpus

• Digital Topology and Geometry in Medical Imaging: A Survey (2015, background): “[97] introduced watershed-cuts, a notion of watershed on edge-weighted graphs, and showed that watershed cuts are equivalent to the separations induced by minimum spanning forests relative to regional minima.”
• Machines that learn to segment images: a crucial technology for connectomics. (2010, methodology): “An analog of the watershed algorithm can be defined for graphs through the minimum spanning tree (Felzenszwalb and Huttenlocher, 2004; Cousty et al., 2008).”