Watershed cuts

Abstract : We study the watersheds in edge-weighted graphs. Contrarily to previous works, we define the watersheds following the intuitive idea of drops of water flowing on a topographic surface. We establish the consistency (with respect to characterizations of the catchment basins and dividing lines) of these watersheds, prove their optimality (in terms of minimum spanning forests) and derive a linear-time algorithm. To our best knowledge, similar properties are not verified in other frameworks and the proposed algorithm is the most efficient existing algorithm.
Document type :
Conference papers
Liste complète des métadonnées

Contributor : Laurent Najman <>
Submitted on : Sunday, September 11, 2011 - 5:08:37 PM
Last modification on : Thursday, July 5, 2018 - 2:26:19 PM


  • HAL Id : hal-00622036, version 1


Jean Cousty, Gilles Bertrand, Laurent Najman, Michel Couprie. Watershed cuts. International Symposium on Mathematical Morphology - International Symposium on Mathematical Morphology'07, 8th International Symposium, Proceedings, 2007, France. pp.301-312. ⟨hal-00622036⟩



Record views