@article {Arnab2018,
	title = {Conditional Random Fields Meet Deep Neural Networks for Semantic Segmentation},
	journal = {Cvpr},
	volume = {XX},
	number = {Xx},
	year = {2018},
	pages = {1{\textendash}15},
	abstract = {{\textemdash}Semantic Segmentation is the task of labelling every pixel in an image with a pre-defined object category. It has numer-ous applications in scenarios where the detailed understanding of an image is required, such as in autonomous vehicles and medical diagnosis. This problem has traditionally been solved with probabilistic models known as Conditional Random Fields (CRFs) due to their ability to model the relationships between the pixels being predicted. However, Deep Neural Networks (DNNs) have recently been shown to excel at a wide range of computer vision problems due to their ability to learn rich feature representations automatically from data, as opposed to traditional hand-crafted features. The idea of combining CRFs and DNNs have achieved state-of-the-art results in a number of domains. We review the literature on combining the modelling power of CRFs with the representation-learning ability of DNNs, ranging from early work that combines these two techniques as independent stages of a common pipeline to recent approaches that embed inference of probabilistic models directly in the neural network itself. Finally, we summarise future research directions.},
	keywords = {conditional random fields, deep learning, seman-},
	url = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.308.8889\&rep=rep1\&type=pdf\%0Ahttp://dx.doi.org/10.1109/CVPR.2012.6248050},
	author = {Arnab, Anurag and Zheng, Shuai and Jayasumana, Sadeep and Romera-paredes, Bernardino and Kirillov, Alexander and Savchynskyy, Bogdan and Carsten Rother and Kahl, Fredrik and Torr, Philip}
}
@conference {Kohli2008,
	title = {On partial optimality in multi-label MRFs},
	booktitle = {Proceedings of the 25th International Conference on Machine Learning},
	year = {2008},
	pages = {480{\textendash}487},
	abstract = {We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as an integer linear programming and relax the integrality constraints. The approach we consider in this paper is to first convert the multi-label MRF into an equivalent binary-label MRF and then to relax it. The resulting relaxation can be efficiently solved using a maximum flow algorithm. Its solution provides us with a partially optimal labelling of the binary variables. This partial labelling is then easily transferred to the multi-label problem. We study the theoretical properties of the new relaxation and compare it with the standard one. Specifically, we compare tightness, and characterize a subclass of problems where the two relaxations coincide. We propose several combined algorithms based on the technique and demonstrate their performance on challenging computer vision problems. Copyright 2008 by the author(s)/owner(s).},
	isbn = {9781605582054},
	doi = {10.1145/1390156.1390217},
	author = {Kohli, Pushmeet and Shekhovtsov, Alexander and Carsten Rother and Kolmogorov, Vladimir and Torr, Philip}
}
