Watersheds on edge or node weighted graphs "par l'exemple"
Computer Vision and Pattern Recognition
2013-03-11 v1
Abstract
Watersheds have been defined both for node and edge weighted graphs. We show that they are identical: for each edge (resp.\ node) weighted graph exists a node (resp. edge) weighted graph with the same minima and catchment basin.
Keywords
Cite
@article{arxiv.1303.1829,
title = {Watersheds on edge or node weighted graphs "par l'exemple"},
author = {Fernand Meyer},
journal= {arXiv preprint arXiv:1303.1829},
year = {2013}
}
Comments
21 pages