Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

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
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Bibliothèque MINES ParisTech Connect in order to contact the contributor
Submitted on : Tuesday, February 3, 2015 - 12:44:00 PM
Last modification on : Monday, June 27, 2022 - 3:06:12 AM
Long-term archiving on: : Wednesday, May 27, 2015 - 1:51:22 PM


Files produced by the author(s)



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⟩



Record views


Files downloads