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.
Type de document :
Communication dans un congrès
Banon Gerald Jean Francis and Barrera Junior and Braga-Neto Ulisses de Mendonça and Hirata Nina Sumiko Tomita. International Symposium on Mathematical Morphology - International Symposium on Mathematical Morphology'07, 8th International Symposium, Proceedings, 2007, France. INPE, 1 (1), pp.301-312, 2007
Liste complète des métadonnées

https://hal-upec-upem.archives-ouvertes.fr/hal-00622036
Contributeur : Laurent Najman <>
Soumis le : dimanche 11 septembre 2011 - 17:08:37
Dernière modification le : dimanche 11 septembre 2011 - 17:08:39

Identifiants

  • HAL Id : hal-00622036, version 1

Citation

Jean Cousty, Gilles Bertrand, Laurent Najman, Michel Couprie. Watershed cuts. Banon Gerald Jean Francis and Barrera Junior and Braga-Neto Ulisses de Mendonça and Hirata Nina Sumiko Tomita. International Symposium on Mathematical Morphology - International Symposium on Mathematical Morphology'07, 8th International Symposium, Proceedings, 2007, France. INPE, 1 (1), pp.301-312, 2007. <hal-00622036>

Partager

Métriques

Consultations de la notice

182