339 citations · 830 across the 27 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.CV2010★ 32 cited
Combinatorial Continuous Maximal Flows
Camille Couprie, Leo Grady, Hugues Talbot +1
Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an…
cs.DM2010★ 63 cited
On the equivalence between hierarchical segmentations and ultrametric watersheds
Laurent Najman
We study hierarchical segmentation in the framework of edge-weighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that there exis…