Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds

Abstract

We recently introduced watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three algorithmic watershed cut strategies: The first one is well suited to parallel implementations, the second one leads to a flexible linear-time sequential implementation, whereas the… (More)
DOI: 10.1109/TPAMI.2009.71

11 Figures and Tables

Topics

Statistics

01020302009201020112012201320142015201620172018
Citations per Year

142 Citations

Semantic Scholar estimates that this publication has 142 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics