Characterization of graph-based hierarchical watersheds: theory and algorithms

Abstract : We propose a characterization of hierarchical watersheds built in the framework of edge-weighted graphs. Based on the notion of binary partition hierarchy by altitude ordering, we provide sufficient and necessary conditions for a hierarchy to be a hierarchical watershed. Those conditions are further used to design an efficient algorithm to recognize hierarchical watersheds. Furthermore, as an immediate application of our theoretical results, we present experiments with the combinations of hierarchical watersheds studied in [15]. Namely, we test if combinations of hierarchical watersheds are hierarchical watersheds themselves.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées

Littérature citée [72 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-02280023
Contributeur : Deise Santana Maia <>
Soumis le : jeudi 5 septembre 2019 - 18:05:56
Dernière modification le : mardi 10 septembre 2019 - 14:22:22

Fichier

characterization.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-02280023, version 1

Collections

Citation

Deise Santana Maia, Jean Cousty, Laurent Najman, Benjamin Perret. Characterization of graph-based hierarchical watersheds: theory and algorithms. 2019. ⟨hal-02280023⟩

Partager

Métriques

Consultations de la notice

49

Téléchargements de fichiers

66