The Image Foresting Transform: Theory, Algorithms, and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle
IEEE Transactions on Pattern Analysis and Machine Intelligence
Mathematical morphology on hypergraphs: preliminary definitions and results
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Mathematical morphology on hypergraphs, application to similarity and positive kernel
Computer Vision and Image Understanding
| Hi-index | 0.00 |
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.