The Mutex Watershed and its Objective: Efficient, Parameter-Free Graph Partitioning
This provides an efficient, parameter-free solution for image segmentation tasks, particularly in biomedical imaging, though it is an incremental improvement over existing graph partitioning methods.
The authors tackled the NP-hard problem of image segmentation without seeds or thresholds by proposing the Mutex Watershed algorithm, which efficiently partitions graphs using attractive and repulsive cues and achieves state-of-the-art results on the ISBI 2012 EM segmentation benchmark.
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 an efficient algorithm for graph partitioning, the "Mutex 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.