Recognizing hierarchical watersheds

Abstract : Combining hierarchical watersheds has proven to be a good alternative method to outperform individual hierarchical watersheds. Consequently, this raises the question of whether the resulting combinations are hierarchical watersheds themselves. Since the naive algorithm to answer this question has a factorial time complexity, we propose a new characterization of hierarchical watersheds which leads to a quasi-linear time algorithm to determine if a hierarchy is a hierarchical watershed.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01948502
Contributor : Deise Santana Maia <>
Submitted on : Wednesday, December 19, 2018 - 3:42:50 PM
Last modification on : Sunday, December 23, 2018 - 1:25:23 AM
Document(s) archivé(s) le : Wednesday, March 20, 2019 - 1:42:27 PM

File

DGCI.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01948502, version 1

Citation

Deise Maia, Jean Cousty, Laurent Najman, Benjamin Perret. Recognizing hierarchical watersheds. 2018. ⟨hal-01948502⟩

Share

Metrics

Record views

50

Files downloads

55