@article {Ding2010,
	title = {Interactive image segmentation using probabilistic hypergraphs},
	journal = {Pattern Recognition},
	volume = {43},
	number = {5},
	year = {2010},
	pages = {1863{\textendash}1873},
	abstract = {This paper introduces a novel interactive framework for segmenting images using probabilistic hypergraphs which model the spatial and appearance relations among image pixels. The probabilistic hypergraph provides us a means to pose image segmentation as a machine learning problem. In particular, we assume that a small set of pixels, which are referred to as seed pixels, are labeled as the object and background. The seed pixels are used to estimate the labels of the unlabeled pixels by learning on a hypergraph via minimizing a quadratic smoothness term formed by a hypergraph Laplacian matrix subject to the known label constraints. We derive a natural probabilistic interpretation of this smoothness term, and provide a detailed discussion on the relation of our method to other hypergraph and graph based learning methods. We also present a front-to-end image segmentation system based on the proposed method, which is shown to achieve promising quantitative and qualitative results on the commonly used GrabCut dataset. {\textcopyright} 2009 Elsevier Ltd. All rights reserved.},
	keywords = {Hypergraphs, Image segmentation, Interactive segmentation, Semi-supervised learning},
	issn = {00313203},
	doi = {10.1016/j.patcog.2009.11.025},
	url = {http://www.research.microsoft.com/vision/cambridge},
	author = {Ding, Lei and Yilmaz, Alper}
}
