Watershed is a well-established clustering and segmentation method. In this article, we aim to achieve a better theoretical understanding of the hierarchical version of the watershed operator. More precisely, we propose a characterization of hierarchical watersheds in the framework of edge-weighted graphs. The proposed characterization leads to an efficient algorithm to recognize hierarchical watersheds.

中文翻译：

---

基于图的层次分水岭的表征：理论和算法

分水岭是一种行之有效的聚类和分割方法。在本文中，我们旨在对分水岭算子的层次版本有更好的理论理解。更准确地说，我们提出了在边缘加权图框架中表征分水岭的方法。拟议的表征导致识别分层分水岭的有效算法。