Clustering with Hypergraphs: The Case for Large Hyperedges 


The extension of conventional clustering to hypergraph clustering, which involves higher order similarities instead of pairwise similarities, is increasingly gaining attention in computer vision. This is due to the fact that many grouping problems require an affinity measure that must involve a subset of data of size more than two, i.e., a hyperedge. Almost all previous works, however, have considered the smallest possible hyperedge size, due to a lack of study into the potential benefits of large hyperedges and effective algorithms to generate them. In this paper, we show that large hyperedges are better from both theoretical and empirical standpoints. We then propose a novel guided sampling strategy for large hyperedges, based on the concept of random cluster models. Our method can generate pure large hyperedges that significantly improve grouping accuracy without exponential increases in sampling costs. In the important applications of face clustering and motion segmentation, our method demonstrates substantially better accuracy and efficiency. 



ECCV 2014 paper. (pdf, 2.1MB)


(pdf), 3MB

Code [8.3MB] (zip)
This is demo code for this work. Only face clustering for Yale face database has been shared. Contact with the first author if you find any difficulty to run this code. 


This research is supported by ARC grant DP130102524.