Playing with Kruskal: algorithms for morphological trees in edge-weighted graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

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.
Fichier principal
Vignette du fichier
ismm2013-algo.pdf (307.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00798621 , version 1 (09-03-2013)

Identifiers

  • HAL Id : hal-00798621 , version 1

Cite

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⟩
357 View
2447 Download

Share

Gmail Facebook X LinkedIn More