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

Jean Cousty, Gilles Bertrand, Laurent Najman, Michel CouprieIEEE TPAMI 2009 · OpenReview

Abstract

We study the watersheds in edge-weighted graphs. We define the watershed cuts following the intuitive idea of drops of water flowing on a topographic surface. We first establish the consistency of these watersheds: they can be equivalently defined by their "catchment basinsrdquo (through a steepest descent property) or by the "dividing linesrdquo separating these catchment basins (through the drop of water principle). Then, we prove, through an equivalence theorem, their optimality in terms of minimum spanning forests. Afterward, we introduce a linear-time algorithm to compute them. To the best of our knowledge, similar properties are not verified in other frameworks and the proposed algorithm is the most efficient existing algorithm, both in theory and in practice. Finally, the defined concepts are illustrated in image segmentation, leading to the conclusion that the proposed approach improves, on the tested images, the quality of watershed-based segmentations.
BibTeX
@article{cousty2009watershed,
  author = {Jean Cousty and Gilles Bertrand and Laurent Najman and Michel Couprie},
  title = {{Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle.}},
  journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
  year = {2009},
  url = {https://openreview.net/forum?id=BQWsGSe_6H},
}

Loading related content...

Figure