Skip to Main content Skip to Navigation
Conference papers

Morphology on graphs and minimum spanning trees

Fernand Meyer 1 Jean Stawiaski 1
1 CMM - Centre de Morphologie Mathématique
Abstract : This paper revisits the construction of watershed and waterfall hierarchies through a thorough analysis of Boruvka's algorithms for constructing minimum spanning trees of edge weighted graphs. In the case where the watershed of a node weighted graph is to be constructed, we propose a distribution of weights on the edges, so that the waterfall extraction on the edge weighted graph becomes equivalent with the watershed extraction on the node weighted graph.
Keywords : Adjunctions on graphs Edge-weighted graph Minimum spanning tree Minimum spanning trees Waterfall Watershed extraction Weighted graph Edge detection Image processing Imaging systems Landforms Mathematical morphology Watersheds Graph theory
Document type :
Conference papers
Complete list of metadatas
https://hal-mines-paristech.archives-ouvertes.fr/hal-00834386
Contributor : Bibliothèque Mines Paristech <>
Submitted on : Friday, June 14, 2013 - 6:05:06 PM
Last modification on : Thursday, September 24, 2020 - 4:38:03 PM

Links full text

istex

Identifiers

Collections

INSMI | ENSMP | PARISTECH | ENSMP_CMM | INSTITUT-TELECOM | PSL

Citation

Fernand Meyer, Jean Stawiaski. Morphology on graphs and minimum spanning trees. 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing, ISMM 2009, Aug 2009, Groningen, Netherlands. pp.161-170, ⟨10.1007/978-3-642-03613-2_15⟩. ⟨hal-00834386⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

267