@article {7468481,
	title = {Joint Segmentation and Shape Regularization with a Generalized Forward Backward Algorithm},
	journal = {IEEE Transactions on Image Processing},
	volume = {25},
	year = {2016},
	pages = {3384 - 3394},
	keywords = {Active contours, Computational modeling, Image segmentation, Manifolds, Shape, Three-dimensional displays, TV},
	issn = {1057-7149},
	doi = {10.1109/TIP.2016.2567068},
	author = {Anca Stefanoiu and Andreas Weinmann and Martin Storath and Nassir Navab and Maximilian Baust}
}
@conference {Zheng2014,
	title = {Dense semantic image segmentation with objects and attributes},
	booktitle = {Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition},
	year = {2014},
	pages = {3214{\textendash}3221},
	abstract = {The concepts of objects and attributes are both important for describing images precisely, since verbal descriptions often contain both adjectives and nouns (e.g. {\textquoteright}I see a shiny red chair{\textquoteright}). In this paper, we formulate the problem of joint visual attribute and object class image segmentation as a dense multi-labelling problem, where each pixel in an image can be associated with both an object-class and a set of visual attributes labels. In order to learn the label correlations, we adopt a boosting-based piecewise training approach with respect to the visual appearance and co-occurrence cues. We use a filtering-based mean-field approximation approach for efficient joint inference. Further, we develop a hierarchical model to incorporate region-level object and attribute information. Experiments on the aPASCAL, CORE and attribute augmented NYU indoor scenes datasets show that the proposed approach is able to achieve state-of-the-art results.},
	keywords = {Attributes, Image segmentation, Object recognition, Scene Understanding},
	isbn = {9781479951178},
	issn = {10636919},
	doi = {10.1109/CVPR.2014.411},
	url = {http://www.robots.ox.ac.uk/\~{}tvg/http://tu-dresden.de/inf/cvld},
	author = {Zheng, Shuai and Cheng, Ming Ming and Warrell, Jonathan and Sturgess, Paul and Vineet, Vibhav and Carsten Rother and Torr, Philip H.S.}
}
@conference {Marquez-Neila2014,
	title = {Non-parametric higher-order random fields for image segmentation},
	booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {8694 LNCS},
	number = {PART 6},
	year = {2014},
	pages = {269{\textendash}284},
	abstract = {Models defined using higher-order potentials are becoming increasingly popular in computer vision. However, the exact representation of a general higher-order potential defined over many variables is computationally unfeasible. This has led prior works to adopt parametric potentials that can be compactly represented. This paper proposes a non-parametric higher-order model for image labeling problems that uses a patch-based representation of its potentials. We use the transformation scheme of [11, 25] to convert the higher-order potentials to a pair-wise form that can be handled using traditional inference algorithms. This representation is able to capture structure, geometrical and topological information of labels from training data and to provide more precise segmentations. Other tasks such as image denoising and reconstruction are also possible. We evaluate our method on denoising and segmentation problems with synthetic and real images. {\textcopyright} 2014 Springer International Publishing.},
	keywords = {biomedical image analysis, higher-order models, image denoising, Image segmentation, random fields, structured prediction},
	isbn = {9783319105987},
	issn = {16113349},
	doi = {10.1007/978-3-319-10599-4_18},
	author = {M{\'a}rquez-Neila, Pablo and Kohli, Pushmeet and Carsten Rother and Baumela, Luis}
}
@article {Lempitsky2012,
	title = {Branch-and-mincut: Global optimization for image segmentation with high-level priors},
	journal = {Journal of Mathematical Imaging and Vision},
	volume = {44},
	number = {3},
	year = {2012},
	pages = {315{\textendash}329},
	abstract = {Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from low-level cues. However, introducing a high-level prior such as a shape prior or a color-distribution prior into the segmentation process typically results in an energy that is much harder to optimize. The main contribution of the paper is a new global optimization framework for a wide class of such energies. The framework is built upon two powerful techniques: graph cut and branch-and-bound. These techniques are unified through the derivation of lower bounds on the energies. Being computable via graph cut, these bounds are used to prune branches within a branchand-bound search. We demonstrate that the new framework can compute globally optimal segmentations for a variety of segmentation scenarios in a reasonable time on a modern CPU. These scenarios include unsupervised segmentation of an object undergoing 3D pose change, category-specific shape segmentation, and the segmentation under intensity/color priors defined by Chan-Vese and GrabCut functionals. {\textcopyright} Springer Science+Business Media, LLC 2011.},
	keywords = {Branch-and-bound, Global optimization, Graph Cuts, Image segmentation, Shape priors},
	issn = {09249907},
	doi = {10.1007/s10851-012-0328-0},
	author = {Lempitsky, Victor and Blake, Andrew and Carsten Rother}
}
@article {Kohli2012,
	title = {User-centric learning and evaluation of interactive segmentation systems},
	journal = {International Journal of Computer Vision},
	volume = {100},
	number = {3},
	year = {2012},
	month = {dec},
	pages = {261{\textendash}274},
	abstract = {Many successful applications of computer vision to image or video manipulation are interactive by nature. However, parameters of such systems are often trained neglecting the user. Traditionally, interactive systems have been treated in the same manner as their fully automatic counterparts. Their performance is evaluated by computing the accuracy of their solutions under some fixed set of user interactions. In this paper, we study the problem of evaluating and learning interactive segmentation systems which are extensively used in the real world. The key questions in this context are how to measure (1) the effort associated with a user interaction, and (2) the quality of the segmentation result as perceived by the user. We conduct a user study to analyze user behavior and answer these questions. Using the insights obtained from these experiments, we propose a framework to evaluate and learn interactive segmentation systems which brings the user in the loop. The framework is based on the use of an active robot user-a simulated model of a human user. We show how this approach can be used to evaluate and learn parameters of state-of-the-art interactive segmentation systems. We also show how simulated user models can be integrated into the popular max-margin method for parameter learning and propose an algorithm to solve the resulting optimisation problem. {\textcopyright} 2012 The Author(s).},
	keywords = {Image segmentation, Interactive systems, Learning},
	issn = {09205691},
	doi = {10.1007/s11263-012-0537-4},
	author = {Kohli, Pushmeet and Nickisch, Hannes and Carsten Rother and Rhemann, Christoph}
}
@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}
}
