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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [8 references]  Display  Hide  Download

https://hal-mines-paristech.archives-ouvertes.fr/hal-01110891
Contributor : Bibliothèque Mines Paristech <>
Submitted on : Tuesday, February 3, 2015 - 12:44:00 PM
Last modification on : Monday, November 12, 2018 - 11:01:10 AM
Document(s) archivé(s) le : Wednesday, May 27, 2015 - 1:51:22 PM

File

ismm2015_fah.pdf
Files produced by the author(s)

Identifiers

Citation

Fernand Meyer. A watershed algorithm progressively unveiling its optimality. ISMM 2015, May 2015, Reykjavic, Iceland. ⟨10.1007/978-3-319-18720-4_60⟩. ⟨hal-01110891⟩

Share

Metrics

Record views

298

Files downloads

157