Characterization of graph-based hierarchical watersheds: theory and algorithms - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Mathematical Imaging and Vision Année : 2020

Characterization of graph-based hierarchical watersheds: theory and algorithms

Résumé

Watershed is a well established clustering and segmentation method. In this article, we aim to achieve a better theoretical understanding of the hierarchical version of the watershed operator. More precisely, we propose a characterization of hierarchical watersheds in the framework of edge-weighted graphs. The proposed characterization leads to an efficient algorithm to recognize hierarchical watersheds.
Fichier principal
Vignette du fichier
JMIV_new_version.pdf (927.28 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02280023 , version 1 (05-09-2019)
hal-02280023 , version 2 (07-04-2020)

Identifiants

Citer

Deise Santana Maia, Jean Cousty, Laurent Najman, Benjamin Perret. Characterization of graph-based hierarchical watersheds: theory and algorithms. International Journal of Mathematical Imaging and Vision, 2020, Special Issue on Discrete Geometry for Computer Imagery 2019, 62 (5), pp.627-658. ⟨10.1007/s10851-019-00936-6⟩. ⟨hal-02280023v2⟩
127 Consultations
251 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More