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

On the probabilities of hierarchical watersheds

Résumé

Hierarchical watersheds are obtained by iteratively merging the regions of a watershed segmentation. In the watershed segmentation of an image, each region contains exactly one (local) minimum of the original image. Therefore, the construction of a hierarchical watershed of any image I can be guided by a total order ≺ on the set of minima of I. The regions that contain the least minima according to the order ≺ are the first regions to be merged in the hierarchy. In fact, given any image I, for any hierarchical watershed H of I, there exists more than one total order on the set of minima of I which could be used to obtain H. In this article, we define the probability of a hierarchical watershed H as the probability of H to be the hierarchical watershed of I for an arbitrary total order on the set of minima of I. We introduce an efficient method to obtain the probability of hierarchical watersheds and we provide a characterization of the most probable hierarchical watersheds.
Fichier principal
Vignette du fichier
On_probabilities_of_hierarchical_watersheds_.pdf (634.22 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02180484 , version 1 (11-07-2019)

Identifiants

Citer

Deise Santana Maia, Jean Cousty, Laurent Najman, Benjamin Perret. On the probabilities of hierarchical watersheds. International Symposium on Mathematical Morphology, Jul 2019, Saarbrücken, Germany. ⟨10.1007/978-3-030-20867-7_11⟩. ⟨hal-02180484⟩
65 Consultations
125 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More