 |
 |
Conference papers
Morphology on graphs and minimum spanning trees
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.
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
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
