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.
Domaines
Traitement des images [eess.IV]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...