Skip to Main content Skip to Navigation
Conference papers

Playing with Kruskal: algorithms for morphological trees in edge-weighted graphs

Abstract : The goal of this paper is to provide linear or quasi-linear algorithms for producing some of the various trees used in mathematical morphology, in particular the trees corresponding to hierarchies of watershed cuts and hierarchies of constrained connectivity. A specific binary tree, corresponding to an ordered version of the edges of the minimum spanning tree, is the key structure in this study, and is computed thanks to variations around Kruskal algorithm for minimum spanning tree.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00798621
Contributor : Laurent Najman <>
Submitted on : Saturday, March 9, 2013 - 11:18:58 AM
Last modification on : Wednesday, February 26, 2020 - 7:06:06 PM
Document(s) archivé(s) le : Sunday, April 2, 2017 - 10:46:48 AM

File

ismm2013-algo.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00798621, version 1

Citation

Laurent Najman, Jean Cousty, Benjamin Perret. Playing with Kruskal: algorithms for morphological trees in edge-weighted graphs. International Symposium on Mathematical Morphology, May 2013, Uppsala, Sweden. pp.135-146. ⟨hal-00798621⟩

Share

Metrics

Record views

577

Files downloads

2310