LAUSR

Watershed Arcs Removal for node-weighted graphs method addressed the over-segmentation problem of classical watershed transformation, in a significantly shorter run-time. In this study, a variation of Watershed Arcs Removal is proposed that generates hierarchical partitioning in an edge-weighted graph. In the proposed method, regions are grown from the nodes having high local similarity to find the initial arcs, and neighbouring regions are merged by gradually removing arcs with low local dissimilarity. The arcs to be removed in a level are selected solely from the arc-graph constructed from the existing arcs in the previous level, weighted by their local dissimilarity. In contrast to the node-weighted variation, a strategy is employed here to preserve the critical arcs. Although the proposed method can be effectively applied to any multi-band image by transforming it into an edge-weighted graph, in this study we evaluated its performance particularly in RGB image segmentation.