Timezone: »

 
Poster
Higher-Order Correlation Clustering for Image Segmentation
Sungwoong Kim · Sebastian Nowozin · Pushmeet Kohli · Chang D. D Yoo

Mon Dec 12 10:00 AM -- 02:59 PM (PST) @
in Poster Session and Reception »

For many of the state-of-the-art computer vision algorithms, image segmentation is an important preprocessing step. As such, several image segmentation algorithms have been proposed, however, with certain reservation due to high computational load and many hand-tuning parameters. Correlation clustering, a graph-partitioning algorithm often used in natural language processing and document clustering, has the potential to perform better than previously proposed image segmentation algorithms. We improve the basic correlation clustering formulation by taking into account higher-order cluster relationships. This improves clustering in the presence of local boundary ambiguities. We first apply the pairwise correlation clustering to image segmentation over a pairwise superpixel graph and then develop higher-order correlation clustering over a hypergraph that considers higher-order relations among superpixels. Fast inference is possible by linear programming relaxation, and also effective parameter learning framework by structured support vector machine is possible. Experimental results on various datasets show that the proposed higher-order correlation clustering outperforms other state-of-the-art image segmentation algorithms.

[ PDF] 

Author Information

Sungwoong Kim (Qualcomm)
Sebastian Nowozin (DeepMind)
Pushmeet Kohli (Microsoft Research)
Chang D. D Yoo (KAIST)

More from the Same Authors