A watershed algorithm progressively unveiling its optimality
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 alg...
Main Author: | |
---|---|
Other Authors: | , , |
Format: | Conference Object |
Language: | English |
Published: |
HAL CCSD
2015
|
Subjects: | |
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 |
id |
ftunivnantes:oai:HAL:hal-01110891v1 |
---|---|
record_format |
openpolar |
spelling |
ftunivnantes:oai:HAL:hal-01110891v1 2023-05-15T16:48:26+02:00 A watershed algorithm progressively unveiling its optimality Meyer, Fernand Centre de Morphologie Mathématique (CMM) Mines Paris - PSL (École nationale supérieure des mines de Paris) Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL) Reykjavic, Iceland 2015-05-27 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 en eng HAL CCSD springer info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-18720-4_60 hal-01110891 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 doi:10.1007/978-3-319-18720-4_60 info:eu-repo/semantics/OpenAccess ISMM 2015 https://hal-mines-paristech.archives-ouvertes.fr/hal-01110891 ISMM 2015, May 2015, Reykjavic, Iceland. ⟨10.1007/978-3-319-18720-4_60⟩ Flooding hierarchical queue Watershed topographic distance steepest lexicographic distance weighted graphs [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS] info:eu-repo/semantics/conferenceObject Conference papers 2015 ftunivnantes https://doi.org/10.1007/978-3-319-18720-4_60 2022-10-19T00:22:34Z 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. Conference Object Iceland Université de Nantes: HAL-UNIV-NANTES 717 728 |
institution |
Open Polar |
collection |
Université de Nantes: HAL-UNIV-NANTES |
op_collection_id |
ftunivnantes |
language |
English |
topic |
Flooding hierarchical queue Watershed topographic distance steepest lexicographic distance weighted graphs [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS] |
spellingShingle |
Flooding hierarchical queue Watershed topographic distance steepest lexicographic distance weighted graphs [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS] Meyer, Fernand A watershed algorithm progressively unveiling its optimality |
topic_facet |
Flooding hierarchical queue Watershed topographic distance steepest lexicographic distance weighted graphs [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS] |
description |
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. |
author2 |
Centre de Morphologie Mathématique (CMM) Mines Paris - PSL (École nationale supérieure des mines de Paris) Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL) |
format |
Conference Object |
author |
Meyer, Fernand |
author_facet |
Meyer, Fernand |
author_sort |
Meyer, Fernand |
title |
A watershed algorithm progressively unveiling its optimality |
title_short |
A watershed algorithm progressively unveiling its optimality |
title_full |
A watershed algorithm progressively unveiling its optimality |
title_fullStr |
A watershed algorithm progressively unveiling its optimality |
title_full_unstemmed |
A watershed algorithm progressively unveiling its optimality |
title_sort |
watershed algorithm progressively unveiling its optimality |
publisher |
HAL CCSD |
publishDate |
2015 |
url |
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 |
op_coverage |
Reykjavic, Iceland |
genre |
Iceland |
genre_facet |
Iceland |
op_source |
ISMM 2015 https://hal-mines-paristech.archives-ouvertes.fr/hal-01110891 ISMM 2015, May 2015, Reykjavic, Iceland. ⟨10.1007/978-3-319-18720-4_60⟩ |
op_relation |
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-18720-4_60 hal-01110891 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 doi:10.1007/978-3-319-18720-4_60 |
op_rights |
info:eu-repo/semantics/OpenAccess |
op_doi |
https://doi.org/10.1007/978-3-319-18720-4_60 |
container_start_page |
717 |
op_container_end_page |
728 |
_version_ |
1766038525121134592 |