@conference {Sellent2016,
	title = {Stereo video deblurring},
	booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {9906 LNCS},
	year = {2016},
	pages = {558{\textendash}575},
	abstract = {Videos acquired in low-light conditions often exhibit motion blur, which depends on the motion of the objects relative to the camera. This is not only visually unpleasing, but can hamper further processing. With this paper we are the first to show how the availability of stereo video can aid the challenging video deblurring task.We leverage 3D scene flow, which can be estimated robustly even under adverse conditions. We go beyond simply determining the object motion in two ways: First, we show how a piecewise rigid 3D scene flow representation allows to induce accurate blur kernels via local homographies. Second, we exploit the estimated motion boundaries of the 3D scene flow to mitigate ringing artifacts using an iterative weighting scheme. Being aware of 3D object motion, our approach can deal robustly with an arbitrary number of independently moving objects. We demonstrate its benefit over state-ofthe- art video deblurring using quantitative and qualitative experiments on rendered scenes and real videos.},
	keywords = {Object motion blur, Scene flow, Spatially-variant deblurring},
	isbn = {9783319464749},
	issn = {16113349},
	doi = {10.1007/978-3-319-46475-6_35},
	author = {Sellent, Anita and Carsten Rother and Roth, Stefan}
}
@techreport {Sellent,
	title = {Stereo Video Deblurring-Supplemental Material},
	year = {2016},
	abstract = {One of the key contributions in our stereo video deblurring is to employ 3D scene flow to induce blur kernels based on homographies. As the difference to inducing blur kernels from an optical flow field may seem subtle but increases deblurring performance considerably, we schematically illustrate the difference of the two ways of generating blur kernels in Fig. 10. (a) 3D motion (b) Image plane projection: Blur kernels from linear displacements (c) Image plane projection: Blur kernels from homographies Fig. 10. Inducing blur matrices: (a) Assume that 3D point P moves with a constant rigid body motion in 3D, e. g. with a yaw motion. The projection of this motion to the image plane (blue) is a circular trajectory. The corresponding 2D ground truth displacement (yellow), however, is a vector in the image plane that connects start and end point of the motion during a time interval. (b) Using optical flow, the blur kernel at a location z is approximated by identifying all pixels that, according to their spatially-variant displacement, pass through z during the time interval. The image content at point x is correctly identified as passing through z. The image content at point y is not identified correctly as its 2D displacement passes z at a distance. Instead, the image content at point{\textasciicircum}ypoint{\textasciicircum} point{\textasciicircum}y is erroneously identified as passing through z, even though{\textasciicircum}ythough{\textasciicircum} though{\textasciicircum}y has a different distance to the rotation center than z. This results in the distorted kernels shown in Fig. 3b. (c) Assuming 3D points in the vicinity of P to form a plane, we employ 3D homographies to generate blur kernels. The blur kernel at location z is thus formed by the image points whose trajectory, according to the homography, passes through z during the time interval. Consequently, y is correctly identified as passing through z, leading to the kernels shaped as circular arcs shown in Fig. 3a},
	author = {Sellent, Anita and Carsten Rother and Roth, Stefan}
}
@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}
}
@article {Lempitsky2010a,
	title = {Fusion moves for markov random field optimization},
	journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
	volume = {32},
	number = {8},
	year = {2010},
	pages = {1392{\textendash}1405},
	abstract = {The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one possible way of achieving this by using graph cuts to combine pairs of suboptimal labelings or solutions. We call this combination process the fusion move. By employing recently developed graph-cut-based algorithms (so-called QPBO-graph cut), the fusion move can efficiently combine two proposal labelings in a theoretically sound way, which is in practice often globally optimal. We demonstrate that fusion moves generalize many previous graph-cut approaches, which allows them to be used as building blocks within a broader variety of optimization schemes than were considered before. In particular, we propose new optimization schemes for computer vision MRFs with applications to image restoration, stereo, and optical flow, among others. Within these schemes the fusion moves are used 1) for the parallelization of MRF optimization into several threads, 2) for fast MRF optimization by combining cheap-to-compute solutions, and 3) for the optimization of highly nonconvex continuous-labeled MRFs with 2D labels. Our final example is a nonvision MRF concerned with cartographic label placement, where fusion moves can be used to improve the performance of a standard inference method (loopy belief propagation). {\textcopyright} 2006 IEEE.},
	keywords = {Combinatorial algorithms, Computer vision, Graph algorithms, Image restoration., Markov random fields, Motion, Stereo},
	issn = {01628828},
	doi = {10.1109/TPAMI.2009.143},
	author = {Lempitsky, Victor and Carsten Rother and Roth, Stefan and Blake, Andrew}
}
@article {Lempitsky2010,
	title = {Fusion moves for markov random field optimization},
	journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
	volume = {32},
	number = {8},
	year = {2010},
	pages = {1392{\textendash}1405},
	abstract = {The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one possible way of achieving this by using graph cuts to combine pairs of suboptimal labelings or solutions. We call this combination process the fusion move. By employing recently developed graph-cut-based algorithms (so-called QPBO-graph cut), the fusion move can efficiently combine two proposal labelings in a theoretically sound way, which is in practice often globally optimal. We demonstrate that fusion moves generalize many previous graph-cut approaches, which allows them to be used as building blocks within a broader variety of optimization schemes than were considered before. In particular, we propose new optimization schemes for computer vision MRFs with applications to image restoration, stereo, and optical flow, among others. Within these schemes the fusion moves are used 1) for the parallelization of MRF optimization into several threads, 2) for fast MRF optimization by combining cheap-to-compute solutions, and 3) for the optimization of highly nonconvex continuous-labeled MRFs with 2D labels. Our final example is a nonvision MRF concerned with cartographic label placement, where fusion moves can be used to improve the performance of a standard inference method (loopy belief propagation). {\textcopyright} 2006 IEEE.},
	keywords = {Combinatorial algorithms, Computer vision, Graph algorithms, Image restoration., Markov random fields, Motion, Stereo},
	issn = {01628828},
	doi = {10.1109/TPAMI.2009.143},
	author = {Lempitsky, Victor and Carsten Rother and Roth, Stefan and Blake, Andrew}
}
@conference {jehle2010,
	title = {Learning of optimal illumination for material classification},
	booktitle = {Pattern Recognition},
	volume = {6376},
	year = {2010},
	pages = {563--572},
	publisher = {Springer},
	organization = {Springer},
	abstract = {We present a method to classify materials in illumination series data. An illumination series is acquired using a device which is capable to generate arbitrary lighting environments covering nearly the whole space of the upper hemisphere. The individual images of the illumination series span a high-dimensional feature space. Using a random forest classifier different materials, which vary in appearance (which itself depends on the patterns of incoming illumination), can be distinguished reliably. The associated Gini feature importance allows for determining the features which are most relevant for the classification result. By linking the features to illumination patterns a proposition about optimal lighting for defect detection can be made, which yields valuable information for the selection and placement of light sources.},
	doi = {10.1007/978-3-642-15986-2_57},
	author = {Markus Jehle and Christoph Sommer and Bernd J{\"a}hne},
	editor = {Goesele, Michael and Roth, Stefan and Schiele, Bernt and Schindler, Konrad and Kuijper, Arjan}
}
@conference {Lempitsky2008,
	title = {FusionFlow: Discrete-continuous optimization for optical flow estimation},
	booktitle = {26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR},
	year = {2008},
	abstract = {Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely on continuous optimization algorithms. The modeling accuracy of the energy in this case is often traded for its tractability. This is in contrast to the related problem of narrow-baseline stereo matching, where the top-performing methods employ powerful discrete optimization algorithms such as graph cuts and message-passing to optimize highly non-convex energies. In this paper, we demonstrate how similar non-convex energies can be formulated and optimized discretely in the context of optical flow estimation. Starting with a set of candidate solutions that are produced by fast continuous flow estimation algorithms, the proposed method iteratively fuses these candidate solutions by the computation of minimum cuts on graphs. The obtained continuous-valued fusion result is then further improved using local gradient descent. Experimentally, we demonstrate that the proposed energy is an accurate model and that the proposed discrete-continuous optimization scheme not only finds lower energy solutions than traditional discrete or continuous optimization techniques, but also leads to flow estimates that outperform the current state-of-the-art. {\textcopyright}2008 IEEE.},
	isbn = {9781424422432},
	doi = {10.1109/CVPR.2008.4587751},
	author = {Lempitsky, Victor and Roth, Stefan and Carsten Rother}
}
