Name
Abstract | ||
|---|---|---|
Image partitioning, or segmentation without semantics, is the task of decomposing an image into distinct segments, or equivalently to detect closed contours. Most prior work either requires seeds, one per segment; or a threshold; or formulates the task as multicut / correlation clustering, an NP-hard problem. Here, we propose a greedy algorithm for signed graph partitioning, the Watershed. Unlike seeded watershed, the algorithm can accommodate not only attractive but also repulsive cues, allowing it to find a previously unspecified number of segments without the need for explicit seeds or a tunable threshold. We also prove that this simple algorithm solves to global optimality an objective function that is intimately related to the multicut / correlation clustering integer linear programming formulation. The algorithm is deterministic, very simple to implement, and has empirically linearithmic complexity. When presented with short-range attractive and long-range repulsive cues from a deep neural network, the Mutex Watershed gives the best results currently known for the competitive ISBI 2012 EM segmentation benchmark. |
Year | Venue | DocType |
|---|---|---|
2019 | arXiv: Computer Vision and Pattern Recognition | Journal |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Steffen Wolf | 1 | 0 | 1.35 |
| Alberto Bailoni | 2 | 0 | 0.68 |
| Constantin Pape | 3 | 1 | 1.39 |
| Nasim Rahaman | 4 | 2 | 2.39 |
| Anna Kreshuk | 5 | 8 | 5.02 |
| Ullrich Koethe | 6 | 249 | 22.37 |
| Fred A. Hamprecht | 7 | 962 | 76.24 |