Ultrametric watersheds: a bijection theorem for hierarchical edge-segmentation

Laurent Najman

Abstract

Abstract. We study hierachical segmentation in the framework of edgeweighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that there exists a bijection between the set of ultrametric watersheds and the set of hierarchical edgesegmentations. We end this paper by showing how the proposed framework allows to see constrained connectivity as a classical watershed-based morphological scheme, which provides an efficient algorithm to compute the whole hierarchy.
BibTeX
@article{najman2011ultrametric,
  author = {Laurent Najman},
  title = {{Ultrametric watersheds: a bijection theorem for hierarchical edge-segmentation}},
  journal = {J. Math. Imaging Vis.},
  year = {2011},
  url = {https://openreview.net/forum?id=hOCJRaU54iU},
}
Figure