2008 |
33 | EE | Sara Vicente,
Vladimir Kolmogorov,
Carsten Rother:
Graph cut based image segmentation with connectivity priors.
CVPR 2008 |
32 | EE | Lorenzo Torresani,
Vladimir Kolmogorov,
Carsten Rother:
Feature Correspondence Via Graph Matching: Models and Global Optimization.
ECCV (2) 2008: 596-609 |
31 | EE | Pushmeet Kohli,
Alexander Shekhovtsov,
Carsten Rother,
Vladimir Kolmogorov,
Philip H. S. Torr:
On partial optimality in multi-label MRFs.
ICML 2008: 480-487 |
30 | EE | Richard Szeliski,
Ramin Zabih,
Daniel Scharstein,
Olga Veksler,
Vladimir Kolmogorov,
Aseem Agarwala,
Marshall F. Tappen,
Carsten Rother:
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors.
IEEE Trans. Pattern Anal. Mach. Intell. 30(6): 1068-1080 (2008) |
29 | EE | Vladimir Kolmogorov,
Antonio Criminisi,
Andrew Blake,
Geoffrey Cross,
Carsten Rother:
Probabilistic Fusion of Stereo with Color and Contrast for Bi-Layer Segmentation.
International Journal of Computer Vision 76(2): 107 (2008) |
2007 |
28 | EE | Carsten Rother,
Vladimir Kolmogorov,
Victor S. Lempitsky,
Martin Szummer:
Optimizing Binary MRFs via Extended Roof Duality.
CVPR 2007 |
27 | EE | Vladimir Kolmogorov,
Yuri Boykov,
Carsten Rother:
Applications of parametric maxflow in computer vision.
ICCV 2007: 1-8 |
26 | EE | Pawan Mudigonda,
Vladimir Kolmogorov,
Philip H. S. Torr:
An Analysis of Convex Relaxations for MAP Estimation.
NIPS 2007 |
25 | EE | Vladimir Kolmogorov,
Carsten Rother:
Minimizing Nonsubmodular Functions with Graph Cuts-A Review.
IEEE Trans. Pattern Anal. Mach. Intell. 29(7): 1274-1279 (2007) |
2006 |
24 | EE | Antonio Criminisi,
Geoffrey Cross,
Andrew Blake,
Vladimir Kolmogorov:
Bilayer Segmentation of Live Video.
CVPR (1) 2006: 53-60 |
23 | EE | Carsten Rother,
Thomas P. Minka,
Andrew Blake,
Vladimir Kolmogorov:
Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs.
CVPR (1) 2006: 993-1000 |
22 | EE | Vladimir Kolmogorov,
Carsten Rother:
Comparison of Energy Minimization Algorithms for Highly Connected Graphs.
ECCV (2) 2006: 1-15 |
21 | EE | Richard Szeliski,
Ramin Zabih,
Daniel Scharstein,
Olga Veksler,
Vladimir Kolmogorov,
Aseem Agarwala,
Marshall F. Tappen,
Carsten Rother:
A Comparative Study of Energy Minimization Methods for Markov Random Fields.
ECCV (2) 2006: 16-29 |
20 | EE | Yuri Boykov,
Vladimir Kolmogorov,
Daniel Cremers,
Andrew Delong:
An Integral Solution to Surface Evolution PDEs Via Geo-cuts.
ECCV (3) 2006: 409-422 |
19 | EE | Vladimir Kolmogorov:
Convergent Tree-Reweighted Message Passing for Energy Minimization.
IEEE Trans. Pattern Anal. Mach. Intell. 28(10): 1568-1583 (2006) |
18 | EE | Vladimir Kolmogorov,
Antonio Criminisi,
Andrew Blake,
Geoffrey Cross,
Carsten Rother:
Probabilistic Fusion of Stereo with Color and Contrast for Bilayer Segmentation.
IEEE Trans. Pattern Anal. Mach. Intell. 28(9): 1480-1492 (2006) |
2005 |
17 | EE | Carsten Rother,
Sanjiv Kumar,
Vladimir Kolmogorov,
Andrew Blake:
Digital Tapestry.
CVPR (1) 2005: 589-596 |
16 | EE | Vladimir Kolmogorov,
Antonio Criminisi,
Andrew Blake,
Geoffrey Cross,
Carsten Rother:
Bi-Layer Segmentation of Binocular Stereo Video.
CVPR (2) 2005: 1186 |
15 | EE | Vladimir Kolmogorov,
Antonio Criminisi,
Andrew Blake,
Geoffrey Cross,
Carsten Rother:
Bi-Layer Segmentation of Binocular Stereo Video.
CVPR (2) 2005: 407-414 |
14 | EE | Vladimir Kolmogorov,
Yuri Boykov:
What Metrics Can Be Approximated by Geo-Cuts, Or Global Optimization of Length/Area and Flux.
ICCV 2005: 564-571 |
13 | EE | Andrew Blake,
Antonio Criminisi,
Geoffrey Cross,
Vladimir Kolmogorov,
Carsten Rother:
Fusion of Stereo, Colour and Contrast.
ISRR 2005: 295-304 |
12 | EE | Vladimir Kolmogorov,
Martin J. Wainwright:
On the Optimality of Tree-reweighted Max-product Message-passing.
UAI 2005: 316-323 |
2004 |
11 | EE | Ramin Zabih,
Vladimir Kolmogorov:
Spatially Coherent Clustering Using Graph Cuts.
CVPR (2) 2004: 437-444 |
10 | EE | Carsten Rother,
Vladimir Kolmogorov,
Andrew Blake:
"GrabCut": interactive foreground extraction using iterated graph cuts.
ACM Trans. Graph. 23(3): 309-314 (2004) |
9 | EE | Vladimir Kolmogorov,
Ramin Zabih:
What Energy Functions Can Be Minimized via Graph Cuts?
IEEE Trans. Pattern Anal. Mach. Intell. 26(2): 147-159 (2004) |
8 | EE | Yuri Boykov,
Vladimir Kolmogorov:
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision.
IEEE Trans. Pattern Anal. Mach. Intell. 26(9): 1124-1137 (2004) |
2003 |
7 | EE | Vladimir Kolmogorov,
Ramin Zabih,
Steven J. Gortler:
Generalized Multi-camera Scene Reconstruction Using Graph Cuts.
EMMCVPR 2003: 501-516 |
6 | EE | Junhwan Kim,
Vladimir Kolmogorov,
Ramin Zabih:
Visual Correspondence Using Energy Minimization and Mutual Information.
ICCV 2003: 1033-1040 |
5 | EE | Yuri Boykov,
Vladimir Kolmogorov:
Computing Geodesics and Minimal Surfaces via Graph Cuts.
ICCV 2003: 26-33 |
2002 |
4 | EE | Vladimir Kolmogorov,
Ramin Zabih:
What Energy Functions Can Be Minimized via Graph Cuts?
ECCV (3) 2002: 65-81 |
3 | EE | Vladimir Kolmogorov,
Ramin Zabih:
Multi-camera Scene Reconstruction via Graph Cuts.
ECCV (3) 2002: 82-96 |
2001 |
2 | EE | Yuri Boykov,
Vladimir Kolmogorov:
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision.
EMMCVPR 2001: 359-374 |
1 | | Vladimir Kolmogorov,
Ramin Zabih:
Computing Visual Correspondence with Occlusions via Graph Cuts.
ICCV 2001: 508-515 |