A watershed algorithm progressively unveiling its optimality

Abstract : In 1991 I described a particularly simple and elegant water-shed algorithm, where the ooding a topographic surface was scheduled by a hierarchical queue. In 2004 the watershed line has been described as the skeleton by zone of inuence for the topographic distance. The same algorithm still applies. In 2012 I dened a new distance based on a lexicographic ordering of the downstream paths leading each node to a regional minimum. Without changing a iota, the same algorithm does the job.
Type de document :
Communication dans un congrès
ISMM 2015, May 2015, Reykjavic, Iceland. springer, Mathematical Morphology and Its Applications to Signal and Image Processing. 〈10.1007/978-3-319-18720-4_60〉
Liste complète des métadonnées

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

https://hal-mines-paristech.archives-ouvertes.fr/hal-01110891
Contributeur : Bibliothèque Mines Paristech <>
Soumis le : mardi 3 février 2015 - 12:44:00
Dernière modification le : vendredi 27 octobre 2017 - 17:36:02
Document(s) archivé(s) le : mercredi 27 mai 2015 - 13:51:22

Fichier

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

Identifiants

Collections

Citation

Fernand Meyer. A watershed algorithm progressively unveiling its optimality. ISMM 2015, May 2015, Reykjavic, Iceland. springer, Mathematical Morphology and Its Applications to Signal and Image Processing. 〈10.1007/978-3-319-18720-4_60〉. 〈hal-01110891〉

Partager

Métriques

Consultations de la notice

240

Téléchargements de fichiers

125