Folgen
Carsten Rother
Carsten Rother
Professor Uni Heidelberg / Germany
Bestätigte E-Mail-Adresse bei iwr.uni-heidelberg.de - Startseite
Titel
Zitiert von
Zitiert von
Jahr
" GrabCut" interactive foreground extraction using iterated graph cuts
C Rother, V Kolmogorov, A Blake
ACM transactions on graphics (TOG) 23 (3), 309-314, 2004
77872004
Textonboost: Joint appearance, shape and context modeling for mulit-class object recognition and segmentation
J Shotton, J Winn, C Rother, A Criminisi
European conference on computer vision (ECCV), 2006
15772006
Textonboost for image understanding: Multi-class object recognition and segmentation by jointly modeling texture, layout, and context
J Shotton, J Winn, C Rother, A Criminisi
International journal of computer vision 81, 2-23, 2009
13562009
Fast cost-volume filtering for visual correspondence and beyond
A Hosni, C Rhemann, M Bleyer, C Rother, M Gelautz
IEEE transactions on pattern analysis and machine intelligence 35 (2), 504-511, 2012
13372012
A comparative study of energy minimization methods for markov random fields with smoothness-based priors
R Szeliski, R Zabih, D Scharstein, O Veksler, V Kolmogorov, A Agarwala, ...
IEEE transactions on pattern analysis and machine intelligence 30 (6), 1068-1080, 2008
12692008
Panoptic segmentation
A Kirillov, K He, R Girshick, C Rother, P Dollár
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern …, 2019
10872019
Interactive image segmentation using an adaptive GMMRF model
A Blake, C Rother, M Brown, P Perez, P Torr
Computer Vision-ECCV 2004: 8th European Conference on Computer Vision …, 2004
8142004
Patchmatch stereo-stereo matching with slanted support windows.
M Bleyer, C Rhemann, C Rother
Bmvc 11, 1-11, 2011
7612011
Learning 6d object pose estimation using 3d object coordinates
E Brachmann, A Krull, F Michel, S Gumhold, J Shotton, C Rother
Computer Vision–ECCV 2014: 13th European Conference, Zurich, Switzerland …, 2014
7232014
Cosegmentation of image pairs by histogram matching-incorporating a global constraint into mrfs
C Rother, T Minka, A Blake, V Kolmogorov
2006 IEEE Computer Society Conference on Computer Vision and Pattern …, 2006
7152006
Optimizing binary MRFs via extended roof duality
C Rother, V Kolmogorov, V Lempitsky, M Szummer
2007 IEEE conference on computer vision and pattern recognition, 1-8, 2007
5642007
Feature correspondence via graph matching: Models and global optimization
L Torresani, V Kolmogorov, C Rother
Computer Vision–ECCV 2008: 10th European Conference on Computer Vision …, 2008
5282008
Graph cut based image segmentation with connectivity priors
S Vicente, V Kolmogorov, C Rother
2008 IEEE conference on computer vision and pattern recognition, 1-8, 2008
5252008
Minimizing nonsubmodular functions with graph cuts-a review
V Kolmogorov, C Rother
IEEE transactions on pattern analysis and machine intelligence 29 (7), 1274-1279, 2007
5192007
A comparative study of energy minimization methods for markov random fields
R Szeliski, R Zabih, D Scharstein, O Veksler, V Kolmogorov, A Agarwala, ...
Computer Vision–ECCV 2006: 9th European Conference on Computer Vision, Graz …, 2006
5192006
Dsac-differentiable ransac for camera localization
E Brachmann, A Krull, S Nowozin, J Shotton, F Michel, S Gumhold, ...
Proceedings of the IEEE conference on computer vision and pattern …, 2017
5172017
Image segmentation with a bounding box prior
V Lempitsky, P Kohli, C Rother, T Sharp
2009 IEEE 12th international conference on computer vision, 277-284, 2009
4962009
A new approach to vanishing point detection in architectural environments
C Rother
Image and Vision Computing 20 (9-10), 647-655, 2002
4932002
Bayesian color constancy revisited
PV Gehler, C Rother, A Blake, T Minka, T Sharp
2008 IEEE Conference on Computer Vision and Pattern Recognition, 1-8, 2008
4752008
Geodesic star convexity for interactive image segmentation
V Gulshan, C Rother, A Criminisi, A Blake, A Zisserman
2010 IEEE Computer Society Conference on Computer Vision and Pattern …, 2010
4672010
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20