@conference {Schelten2015,
	title = {Interleaved regression tree field cascades for blind image deconvolution},
	booktitle = {Proceedings - 2015 IEEE Winter Conference on Applications of Computer Vision, WACV 2015},
	year = {2015},
	pages = {494{\textendash}501},
	abstract = {Image blur from camera shake is a common cause for poor image quality in digital photography, prompting a significant recent interest in image deblurring. The vast majority of work on blind deblurring splits the problem into two subsequent steps: First, the blur process (i.e., blur kernel) is estimated, then the image is restored given the estimated kernel using a non-blind deblurring algorithm. Recent work in non-blind deblurring has shown that discriminative approaches can have clear image quality and runtime benefits over typical generative formulations. In this paper, we propose a cascade for blind deblurring that alternates between kernel estimation and discriminative deblurring using regression tree fields (RTFs). We further contribute a new dataset of realistic image blur kernels from human camera shake, which we use to train the discriminative component. Extensive qualitative and quantitative experiments show a clear gain in image quality by interleaving kernel estimation and discriminative deblurring in an iterative cascade.},
	isbn = {9781479966820},
	doi = {10.1109/WACV.2015.72},
	author = {Schelten, Kevin and Nowozin, Sebastian and Jancsary, Jeremy and Carsten Rother and Roth, Stefan}
}
@techreport {Schmidt,
	title = {Discriminative Non-blind Deblurring},
	year = {2013},
	abstract = {Non-blind deblurring is an integral component of blind approaches for removing image blur due to camera shake. Even though learning-based deblurring methods exist, they have been limited to the generative case and are compu-tationally expensive. To this date, manually-defined models are thus most widely used, though limiting the attained restoration quality. We address this gap by proposing a dis-criminative approach for non-blind deblurring. One key challenge is that the blur kernel in use at test time is not known in advance. To address this, we analyze existing approaches that use half-quadratic regularization. From this analysis, we derive a discriminative model cascade for image deblurring. Our cascade model consists of a Gaus-sian CRF at each stage, based on the recently introduced regression tree fields. We train our model by loss minimization and use synthetically generated blur kernels to generate training data. Our experiments show that the proposed approach is efficient and yields state-of-the-art restoration quality on images corrupted with synthetic and real blur.},
	author = {Schmidt, Uwe and Carsten Rother and Nowozin, Sebastian and Jancsary, Jeremy and Roth, Stefan}
}
@conference {Jancsary2013,
	title = {Learning convex QP relaxations for structured prediction},
	booktitle = {30th International Conference on Machine Learning, ICML 2013},
	number = {PART 3},
	year = {2013},
	pages = {1952{\textendash}1960},
	abstract = {We introduce a new large margin approach to discriminative training of intractable discrete graphical models. Our approach builds on a convex quadratic programming relaxation of the MAP inference problem. The model parameters are trained directly within this restricted class of energy functions so as to optimize the predictions on the training data. We address the issue of how to parameterize the resulting model and point out its relation to existing approaches. The primary motivation behind our use of the QP relaxation is its computational efficiency; yet, empirically, its predictive accuracy compares favorably to more expensive approaches. This makes it an appealing choice for many practical tasks. Copyright 2013 by the author(s).},
	author = {Jancsary, Jeremy and Nowozin, Sebastian and Carsten Rother}
}
@conference {Jancsary2012,
	title = {Loss-specific training of non-parametric image restoration models: A new state of the art},
	booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {7578 LNCS},
	number = {PART 7},
	year = {2012},
	pages = {112{\textendash}125},
	abstract = {After a decade of rapid progress in image denoising, recent methods seem to have reached a performance limit. Nonetheless, we find that state-of-the-art denoising methods are visually clearly distinguishable and possess complementary strengths and failure modes. Motivated by this observation, we introduce a powerful non-parametric image restoration framework based on Regression Tree Fields (RTF). Our restoration model is a densely-connected tractable conditional random field that leverages existing methods to produce an image-dependent, globally consistent prediction. We estimate the conditional structure and parameters of our model from training data so as to directly optimize for popular performance measures. In terms of peak signal-to-noise-ratio (PSNR), our model improves on the best published denoising method by at least 0.26dB across a range of noise levels. Our most practical variant still yields statistically significant improvements, yet is over 20x faster than the strongest competitor. Our approach is well-suited for many more image restoration and low-level vision problems, as evidenced by substantial gains in tasks such as removal of JPEG blocking artefacts. {\textcopyright} 2012 Springer-Verlag.},
	isbn = {9783642337857},
	issn = {03029743},
	doi = {10.1007/978-3-642-33786-4_9},
	author = {Jancsary, Jeremy and Nowozin, Sebastian and Carsten Rother}
}
@conference {Jancsary2012a,
	title = {Loss-specific training of non-parametric image restoration models: A new state of the art},
	booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {7578 LNCS},
	number = {PART 7},
	year = {2012},
	pages = {112{\textendash}125},
	abstract = {After a decade of rapid progress in image denoising, recent methods seem to have reached a performance limit. Nonetheless, we find that state-of-the-art denoising methods are visually clearly distinguishable and possess complementary strengths and failure modes. Motivated by this observation, we introduce a powerful non-parametric image restoration framework based on Regression Tree Fields (RTF). Our restoration model is a densely-connected tractable conditional random field that leverages existing methods to produce an image-dependent, globally consistent prediction. We estimate the conditional structure and parameters of our model from training data so as to directly optimize for popular performance measures. In terms of peak signal-to-noise-ratio (PSNR), our model improves on the best published denoising method by at least 0.26dB across a range of noise levels. Our most practical variant still yields statistically significant improvements, yet is over 20x faster than the strongest competitor. Our approach is well-suited for many more image restoration and low-level vision problems, as evidenced by substantial gains in tasks such as removal of JPEG blocking artefacts. {\textcopyright} 2012 Springer-Verlag.},
	isbn = {9783642337857},
	issn = {03029743},
	doi = {10.1007/978-3-642-33786-4_9},
	author = {Jancsary, Jeremy and Nowozin, Sebastian and Carsten Rother}
}
@conference {Jancsary2012b,
	title = {Non-parametric crfs for image labeling},
	booktitle = {NIPS Workshop Modern Nonparametric Methods in Machine Learning},
	number = {2},
	year = {2012},
	pages = {1{\textendash}5},
	abstract = {We introduce a powerful non-parametric image labeling framework, Regression Tree Fields (RTFs), and discuss its application to image restoration. The conditional structure and the parameters of our model are estimated from training data so as to directly optimize for popular performance measures, resulting in excellent predictive performance at low computational cost.},
	url = {http://www.nowozin.net/sebastian/papers/jancsary2012nonparametriccrf.pdf},
	author = {Jancsary, Jeremy and Nowozin, Sebastian and Carsten Rother}
}
@conference {Jancsary2012c,
	title = {Regression Tree Fields An efficient, non-parametric approach to image labeling problems},
	booktitle = {Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition},
	year = {2012},
	pages = {2376{\textendash}2383},
	abstract = {We introduce Regression Tree Fields (RTFs), a fully conditional random field model for image labeling problems. RTFs gain their expressive power from the use of non-parametric regression trees that specify a tractable Gaussian random field, thereby ensuring globally consistent predictions. Our approach improves on the recently introduced decision tree field (DTF) model [14] in three key ways: (i) RTFs have tractable test-time inference, making efficient optimal predictions feasible and orders of magnitude faster than for DTFs, (ii) RTFs can be applied to both discrete and continuous vector-valued labeling tasks, and (Hi) the entire model, including the structure of the regression trees and energy function parameters, can be efficiently and jointly learned from training data. We demonstrate the expressive power and flexibility of the RTF model on a wide variety of tasks, including inpainting, colorization, denoising, and joint detection and registration. We achieve excellent predictive performance which is on par with, or even surpassing, DTFs on all tasks where a comparison is possible. {\textcopyright} 2012 IEEE.},
	isbn = {9781467312264},
	issn = {10636919},
	doi = {10.1109/CVPR.2012.6247950},
	author = {Jancsary, Jeremy and Nowozin, Sebastian and Sharp, Toby and Carsten Rother}
}
@conference {Jancsary2012d,
	title = {Regression Tree Fields An efficient, non-parametric approach to image labeling problems},
	booktitle = {Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition},
	year = {2012},
	pages = {2376{\textendash}2383},
	abstract = {We introduce Regression Tree Fields (RTFs), a fully conditional random field model for image labeling problems. RTFs gain their expressive power from the use of non-parametric regression trees that specify a tractable Gaussian random field, thereby ensuring globally consistent predictions. Our approach improves on the recently introduced decision tree field (DTF) model [14] in three key ways: (i) RTFs have tractable test-time inference, making efficient optimal predictions feasible and orders of magnitude faster than for DTFs, (ii) RTFs can be applied to both discrete and continuous vector-valued labeling tasks, and (Hi) the entire model, including the structure of the regression trees and energy function parameters, can be efficiently and jointly learned from training data. We demonstrate the expressive power and flexibility of the RTF model on a wide variety of tasks, including inpainting, colorization, denoising, and joint detection and registration. We achieve excellent predictive performance which is on par with, or even surpassing, DTFs on all tasks where a comparison is possible. {\textcopyright} 2012 IEEE.},
	isbn = {9781467312264},
	issn = {10636919},
	doi = {10.1109/CVPR.2012.6247950},
	author = {Jancsary, Jeremy and Nowozin, Sebastian and Sharp, Toby and Carsten Rother}
}
