Playing with Kruskal: algorithms for morphological trees in edge-weighted graphsReportar como inadecuado




Playing with Kruskal: algorithms for morphological trees in edge-weighted graphs - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 LIGM - Laboratoire d-Informatique Gaspard-Monge

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.

Keywords : Algorithms Morphological trees constrained connectivity watershed cuts hierarchies





Autor: Laurent Najman - Jean Cousty - Benjamin Perret -

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados