Stochastic Image Segmentation by Typical Cuts

We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochastic nature of our method makes it robust against noise, including accidental edges and small spurious clusters. We demonstrate the robustness and superiority of our method for image segmentation on a few synthetic examples where other recently proposed methods (such as normalized-cut) fail. In addition, the complexity of our method is lower. We describe experiments with real images showing good segmentation results.

• Type: Conference
• Year: 1999
• Where: CVPR
• Authors: Yoram Gdalyahu, Daphna Weinshall, Michael Werman
• Keywords: Computer Vision, CVPR 1999, Graph Theoretical Algorithm, Small Spurious Clusters, Stochastic Clustering Algorithm