Recognizing hierarchical watersheds - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Recognizing hierarchical watersheds

Résumé

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.
Fichier principal
Vignette du fichier
DGCI.pdf (698.57 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01948502 , version 1 (19-12-2018)

Identifiants

Citer

Deise S Maia, Jean Cousty, Laurent Najman, Benjamin Perret. Recognizing hierarchical watersheds. DGCI2019, Mar 2019, Noisy-le-grand, France. pp.300-313, ⟨10.1007/978-3-030-14085-4_24⟩. ⟨hal-01948502⟩
97 Consultations
254 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More