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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [72 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02280023
Contributor : Deise Santana Maia <>
Submitted on : Thursday, September 5, 2019 - 6:05:56 PM
Last modification on : Tuesday, September 10, 2019 - 2:22:22 PM

File

characterization.pdf
Files produced by the author(s)

Identifiers

  • 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⟩

Share

Metrics

Record views

11

Files downloads

27