A watershed algorithm progressively unveiling its optimality

• Main Author: Meyer, Fernand
• Other Authors: Centre de Morphologie Mathématique (CMM), MINES ParisTech - École nationale supérieure des mines de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)
• Format: Conference Object
• Language: English
• Published: HAL CCSD 2015
• Subjects: weighted graphs; steepest lexicographic distance; topographic distance; hierarchical queue; Watershed; Flooding; [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]; Iceland
• Online Access: https://hal-mines-paristech.archives-ouvertes.fr/hal-01110891; https://hal-mines-paristech.archives-ouvertes.fr/hal-01110891/document; https://hal-mines-paristech.archives-ouvertes.fr/hal-01110891/file/ismm2015_fah.pdf; https://doi.org/10.1007/978-3-319-18720-4_60

International audience 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.