Search For:

Displaying 1-32 out of 32 total
Decision tree fields
Found in: Computer Vision, IEEE International Conference on
By Sebastian Nowozin,Carsten Rother,Shai Bagon,Toby Sharp, Bangpeng Yao,Pushmeet Kohli
Issue Date:November 2011
pp. 1668-1675
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fields (CRF) which have been widely used in computer vision. In a typical CRF mode...
 
REal-time local stereo matching using guided image filtering
Found in: Multimedia and Expo, IEEE International Conference on
By Asmaa Hosni,Michael Bleyer,Christoph Rhemann,Margrit Gelautz,Carsten Rother
Issue Date:July 2011
pp. 1-6
Adaptive support weight algorithms represent the state-of the-art in local stereo matching. Their limitation is a high computational demand, which makes them unattractive for many (real-time) applications. To our knowledge, the algorithm proposed in this p...
 
A spatially varying PSF-based prior for alpha matting
Found in: Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
By Christoph Rhemann, Carsten Rother, Pushmeet Kohli, Margrit Gelautz
Issue Date:June 2010
pp. 2149-2156
In this paper we considerably improve on a state-of-the-art alpha matting approach by incorporating a new prior which is based on the image formation process. In particular, we model the prior probability of an alpha matte as the convolution of a high-reso...
 
Geodesic star convexity for interactive image segmentation
Found in: Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
By Varun Gulshan, Carsten Rother, Antonio Criminisi, Andrew Blake, Andrew Zisserman
Issue Date:June 2010
pp. 3129-3136
In this paper we introduce a new shape constraint for interactive image segmentation. It is an extension of Veksler's [25] star-convexity prior, in two ways: from a single star to multiple stars and from Euclidean rays to Geodesic paths. Global minima of t...
 
Surface stereo with soft segmentation
Found in: Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
By Michael Bleyer, Carsten Rother, Pushmeet Kohli
Issue Date:June 2010
pp. 1570-1577
This paper proposes a new stereo model which encodes the simple assumption that the scene is composed of a few, smooth surfaces. A key feature of our model is the surface-based representation, where each pixel is assigned to a 3D surface (planes or B-splin...
 
Fusion Moves for Markov Random Field Optimization
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Victor Lempitsky, Carsten Rother, Stefan Roth, Andrew Blake
Issue Date:August 2010
pp. 1392-1405
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...
 
FusionFlow: Discrete-continuous optimization for optical flow estimation
Found in: Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
By Victor Lempitsky, Stefan Roth, Carsten Rother
Issue Date:June 2008
pp. 1-8
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...
 
Bayesian color constancy revisited
Found in: Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
By Peter Vincent Gehler, Carsten Rother, Andrew Blake, Tom Minka, Toby Sharp
Issue Date:June 2008
pp. 1-8
Computational color constancy is the task of estimating the true reflectances of visible surfaces in an image. In this paper we follow a line of research that assumes uniform illumination of a scene, and that the principal step in estimating reflectances i...
 
High resolution matting via interactive trimap segmentation
Found in: Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
By Christoph Rhemann, Carsten Rother, Alex Rav-Acha, Toby Sharp
Issue Date:June 2008
pp. 1-8
We present a new approach to the matting problem which splits the task into two steps: interactive trimap extraction followed by trimap-based alpha matting. By doing so we gain considerably in terms of speed and quality and are able to deal with high resol...
 
Graph cut based image segmentation with connectivity priors
Found in: Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
By Sara Vicente, Vladimir Kolmogorov, Carsten Rother
Issue Date:June 2008
pp. 1-8
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated objects due to the “shrinking bias”. To overcome this problem, we propose to imp...
 
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Richard Szeliski, Ramin Zabih, Daniel Scharstein, Olga Veksler, Vladimir Kolmogorov, Aseem Agarwala, Marshall Tappen, Carsten Rother
Issue Date:June 2008
pp. 1068-1080
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation. It has been known for decades that such problems can be elegantly expressed...
 
Applications of parametric maxflow in computer vision
Found in: Computer Vision, IEEE International Conference on
By Vladimir Kolmogorov, Yuri Boykov, Carsten Rother
Issue Date:October 2007
pp. 1-8
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linearly on parameter ¿. In this paper we study vision applications for which it i...
 
LogCut - Efficient Graph Cut Optimization for Markov Random Fields
Found in: Computer Vision, IEEE International Conference on
By Victor Lempitsky, Carsten Rother, Andrew Blake
Issue Date:October 2007
pp. 1-8
Markov Random Fields (MRFs) are ubiquitous in low-level computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to ¿-expansion it is based on iterative application of binary graph cut. However, the num...
 
Minimizing Nonsubmodular Functions with Graph Cuts-A Review
Found in: IEEE Transactions on Pattern Analysis and Machine Intelligence
By Vladimir Kolmogorov, Carsten Rother
Issue Date:July 2007
pp. 1274-1279
Optimization techniques based on graph cuts have become a standard tool for many vision applications. These techniques allow to minimize efficiently certain energy functions corresponding to pairwise Markov Random Fields (MRFs). Currently, there is an acce...
 
Optimizing Binary MRFs via Extended Roof Duality
Found in: Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
By Carsten Rother, Vladimir Kolmogorov, Victor Lempitsky, Martin Szummer
Issue Date:June 2007
pp. 1-8
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optimizing such MRFs known as
 
3D LayoutCRF for Multi-View Object Class Recognition and Segmentation
Found in: Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
By Derek Hoiem, Carsten Rother, John Winn
Issue Date:June 2007
pp. 1-8
We introduce an approach to accurately detect and segment partially occluded objects in various viewpoints and scales. Our main contribution is a novel framework for combining object-level descriptions (such as position, shape, and color) with pixel-level ...
 
Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs
Found in: Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
By Carsten Rother, Tom Minka, Andrew Blake, Vladimir Kolmogorov
Issue Date:June 2006
pp. 993-1000
We introduce the term cosegmentation which denotes the task of segmenting simultaneously the common parts of an image pair. A generative model for cosegmentation is presented. Inference in the model leads to minimizing an energy with an MRF term encoding s...
 
Digital Tapestry
Found in: Computer Vision and Pattern Recognition, IEEE Computer Society Conference on
By Carsten Rother, Sanjiv Kumar, Vladimir Kolmogorov, Andrew Blake
Issue Date:June 2005
pp. 589-596
This paper addresses the novel problem of automatically synthesizing an output image from a large collection of different input images. The synthesized image, called a digital tapestry, can be viewed as a visual summary or a virtual ?thumbnail? of all the ...
 
Linear Multi-View Reconstruction of Points, Lines, Planes and Cameras using a Reference Plane
Found in: Computer Vision, IEEE International Conference on
By Carsten Rother
Issue Date:October 2003
pp. 1210
This paper presents a new linear method for reconstructing simultaneously 3D features (points, lines and planes) and cameras from many perspective views by solving a single linear system. It assumes that a real or virtual reference plane is visible in all ...
 
Projective Factorization of Planes and Cameras in Multiple Views
Found in: Pattern Recognition, International Conference on
By Carsten Rother, Stefan Carlsson, Dennis Tell
Issue Date:August 2002
pp. 20737
This paper proposes a novel method for the projective reconstruction of planes and cameras from multiple images by factorizing a matrix containing all planar homographies between a reference view and all other views. If some planes are not visible in all v...
 
Linear Multi View Reconstruction and Camera Recovery
Found in: Computer Vision, IEEE International Conference on
By Carsten Rother, Stefan Carlsson
Issue Date:July 2001
pp. 42
This paper presents a linear algorithm for the simultaneous computation of 3D points and camera positions from multiple perspective views, based on having four points on a reference plane visible in all views. The reconstruction and camera recovery is achi...
 
A Comparative Study of Modern Inference Techniques for Discrete Energy Minimization Problems
Found in: 2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
By Jorg H. Kappes,Bjoern Andres,Fred A. Hamprecht,Christoph Schnorr,Sebastian Nowozin,Dhruv Batra,Sungwoong Kim,Bernhard X. Kausler,Jan Lellmann,Nikos Komodakis,Carsten Rother
Issue Date:June 2013
pp. 1328-1335
Even years ago, Szeliski et al. published an influential study on energy minimization methods for Markov random fields (MRF). This study provided valuable insights in choosing the best optimization technique for certain classes of problems. While these ins...
 
Discriminative Non-blind Deblurring
Found in: 2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
By Uwe Schmidt,Carsten Rother,Sebastian Nowozin,Jeremy Jancsary,Stefan Roth
Issue Date:June 2013
pp. 604-611
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 computationally expensive. To this dat...
 
Depth Super Resolution by Rigid Body Self-Similarity in 3D
Found in: 2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
By Michael Hornacek,Christoph Rhemann,Margrit Gelautz,Carsten Rother
Issue Date:June 2013
pp. 1123-1130
We tackle the problem of jointly increasing the spatial resolution and apparent measurement accuracy of an input low-resolution, noisy, and perhaps heavily quantized depth map. In stark contrast to earlier work, we make no use of ancillary data like a colo...
 
Learning an interactive segmentation system
Found in: Proceedings of the Seventh Indian Conference on Computer Vision, Graphics and Image Processing (ICVGIP '10)
By Carsten Rother, Christoph Rhemann, Hannes Nickisch, Pushmeet Kohli
Issue Date:December 2010
pp. 274-281
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 ...
     
Geodesic image and video editing
Found in: ACM Transactions on Graphics (TOG)
By Antonio Criminisi, Carsten Rother, Patrick P'erez, Toby Sharp
Issue Date:October 2010
pp. 1-15
This article presents a new, unified technique to perform general edge-sensitive editing operations on n-dimensional images and videos efficiently. The first contribution of the article is the introduction of a Generalized Geodesic Distance Transform (GGDT...
     
Unwrap mosaics: a new representation for video editing
Found in: ACM Transactions on Graphics (TOG)
By Alex Rav-Acha, Andrew Fitzgibbon, Carsten Rother, Pushmeet Kohli
Issue Date:August 2008
pp. 1-49
We introduce a new representation for video which facilitates a number of common editing tasks. The representation has some of the power of a full reconstruction of 3D surface models from video, but is designed to be easy to recover from a priori unseen an...
     
On partial optimality in multi-label MRFs
Found in: Proceedings of the 25th international conference on Machine learning (ICML '08)
By Alexander Shekhovtsov, Carsten Rother, Philip Torr, Pushmeet Kohli, Vladimir Kolmogorov
Issue Date:July 2008
pp. 480-487
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 app...
     
Do life-logging technologies support memory for the past?: an experimental study using sensecam
Found in: Proceedings of the SIGCHI conference on Human factors in computing systems (CHI '07)
By Abigail J. Sellen, Andrew Fogg, Carsten Rother, Ken Wood, Mike Aitken, Steve Hodges
Issue Date:April 2007
pp. 81-90
We report on the results of a study using SenseCam, a "life-logging" technology in the form of a wearable camera, which aims to capture data about everyday life in order to support people's memory for past, personal events. We find evidence that SenseCam i...
     
AutoCollage: Copyright restrictions prevent ACM from providing the full text for this work.
Found in: ACM SIGGRAPH 2006 Papers (SIGGRAPH '06)
By Andrew Blake, Carsten Rother, Lucas Bordeaux, Youssef Hamadi
Issue Date:July 2006
pp. 43-es
The paper defines an automatic procedure for constructing a visually appealing collage from a collection of input images. The aim is that the resulting collage should be representative of the collection, summarising its main themes. It is also assembled la...
     
AutoCollage: Copyright restrictions prevent ACM from providing the full text for this work.
Found in: Material presented at the ACM SIGGRAPH 2006 conference (SIGGRAPH '06)
By Andrew Blake, Carsten Rother, Lucas Bordeaux, Youssef Hamadi
Issue Date:July 2006
pp. 43-es
The paper defines an automatic procedure for constructing a visually appealing collage from a collection of input images. The aim is that the resulting collage should be representative of the collection, summarising its main themes. It is also assembled la...
     
"GrabCut": interactive foreground extraction using iterated graph cuts
Found in: ACM Transactions on Graphics (TOG)
By Andrew Blake, Carsten Rother, Vladimir Kolmogorov
Issue Date:August 2004
pp. 309-314
The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) info...
     
 1