The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vladimir Kolmogorov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Antonio Criminisi, Geoffrey Cross, Andrew Blake, Vladimir Kolmogorov
    Bilayer Segmentation of Live Video. [Citation Graph (0, 0)][DBLP]
    CVPR (1), 2006, pp:53-60 [Conf]
  2. Vladimir Kolmogorov, Antonio Criminisi, Andrew Blake, Geoff Cross, Carsten Rother
    Bi-Layer Segmentation of Binocular Stereo Video. [Citation Graph (0, 0)][DBLP]
    CVPR (2), 2005, pp:407-414 [Conf]
  3. Vladimir Kolmogorov, Antonio Criminisi, Andrew Blake, Geoff Cross, Carsten Rother
    Bi-Layer Segmentation of Binocular Stereo Video. [Citation Graph (0, 0)][DBLP]
    CVPR (2), 2005, pp:1186- [Conf]
  4. Carsten Rother, Sanjiv Kumar, Vladimir Kolmogorov, Andrew Blake
    Digital Tapestry. [Citation Graph (0, 0)][DBLP]
    CVPR (1), 2005, pp:589-596 [Conf]
  5. Carsten Rother, Thomas P. Minka, Andrew Blake, Vladimir Kolmogorov
    Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs. [Citation Graph (0, 0)][DBLP]
    CVPR (1), 2006, pp:993-1000 [Conf]
  6. Ramin Zabih, Vladimir Kolmogorov
    Spatially Coherent Clustering Using Graph Cuts. [Citation Graph (0, 0)][DBLP]
    CVPR (2), 2004, pp:437-444 [Conf]
  7. Yuri Boykov, Vladimir Kolmogorov, Daniel Cremers, Andrew Delong
    An Integral Solution to Surface Evolution PDEs Via Geo-cuts. [Citation Graph (0, 0)][DBLP]
    ECCV (3), 2006, pp:409-422 [Conf]
  8. Vladimir Kolmogorov, Carsten Rother
    Comparison of Energy Minimization Algorithms for Highly Connected Graphs. [Citation Graph (0, 0)][DBLP]
    ECCV (2), 2006, pp:1-15 [Conf]
  9. Vladimir Kolmogorov, Ramin Zabih
    What Energy Functions Can Be Minimized via Graph Cuts? [Citation Graph (0, 0)][DBLP]
    ECCV (3), 2002, pp:65-81 [Conf]
  10. Vladimir Kolmogorov, Ramin Zabih
    Multi-camera Scene Reconstruction via Graph Cuts. [Citation Graph (0, 0)][DBLP]
    ECCV (3), 2002, pp:82-96 [Conf]
  11. 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. [Citation Graph (0, 0)][DBLP]
    ECCV (2), 2006, pp:16-29 [Conf]
  12. Vladimir Kolmogorov, Ramin Zabih, Steven J. Gortler
    Generalized Multi-camera Scene Reconstruction Using Graph Cuts. [Citation Graph (0, 0)][DBLP]
    EMMCVPR, 2003, pp:501-516 [Conf]
  13. Yuri Boykov, Vladimir Kolmogorov
    An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision. [Citation Graph (0, 0)][DBLP]
    EMMCVPR, 2001, pp:359-374 [Conf]
  14. Yuri Boykov, Vladimir Kolmogorov
    Computing Geodesics and Minimal Surfaces via Graph Cuts. [Citation Graph (0, 0)][DBLP]
    ICCV, 2003, pp:26-33 [Conf]
  15. Junhwan Kim, Vladimir Kolmogorov, Ramin Zabih
    Visual Correspondence Using Energy Minimization and Mutual Information. [Citation Graph (0, 0)][DBLP]
    ICCV, 2003, pp:1033-1040 [Conf]
  16. Vladimir Kolmogorov, Yuri Boykov
    What Metrics Can Be Approximated by Geo-Cuts, Or Global Optimization of Length/Area and Flux. [Citation Graph (0, 0)][DBLP]
    ICCV, 2005, pp:564-571 [Conf]
  17. Vladimir Kolmogorov, Ramin Zabih
    Computing Visual Correspondence with Occlusions via Graph Cuts. [Citation Graph (0, 0)][DBLP]
    ICCV, 2001, pp:508-515 [Conf]
  18. Yuri Boykov, Vladimir Kolmogorov
    An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2004, v:26, n:9, pp:1124-1137 [Journal]
  19. Vladimir Kolmogorov, Antonio Criminisi, Andrew Blake, Geoffrey Cross, Carsten Rother
    Probabilistic Fusion of Stereo with Color and Contrast for Bilayer Segmentation. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2006, v:28, n:9, pp:1480-1492 [Journal]
  20. Vladimir Kolmogorov, Ramin Zabih
    What Energy Functions Can Be Minimized via Graph Cuts? [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2004, v:26, n:2, pp:147-159 [Journal]
  21. Vladimir Kolmogorov
    Convergent Tree-Reweighted Message Passing for Energy Minimization. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2006, v:28, n:10, pp:1568-1583 [Journal]
  22. Vladimir Kolmogorov, Carsten Rother
    Minimizing Nonsubmodular Functions with Graph Cuts-A Review. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2007, v:29, n:7, pp:1274-1279 [Journal]
  23. Carsten Rother, Vladimir Kolmogorov, Andrew Blake
    "GrabCut": interactive foreground extraction using iterated graph cuts. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Graph., 2004, v:23, n:3, pp:309-314 [Journal]
  24. Carsten Rother, Vladimir Kolmogorov, Victor S. Lempitsky, Martin Szummer
    Optimizing Binary MRFs via Extended Roof Duality. [Citation Graph (0, 0)][DBLP]
    CVPR, 2007, pp:- [Conf]
  25. Vladimir Kolmogorov, Martin J. Wainwright
    On the Optimality of Tree-reweighted Max-product Message-passing. [Citation Graph (0, 0)][DBLP]
    UAI, 2005, pp:316-323 [Conf]

  26. Graph cut based image segmentation with connectivity priors. [Citation Graph (, )][DBLP]


  27. Feature Correspondence Via Graph Matching: Models and Global Optimization. [Citation Graph (, )][DBLP]


  28. Applications of parametric maxflow in computer vision. [Citation Graph (, )][DBLP]


  29. On partial optimality in multi-label MRFs. [Citation Graph (, )][DBLP]


  30. An Analysis of Convex Relaxations for MAP Estimation. [Citation Graph (, )][DBLP]


  31. Fusion of Stereo, Colour and Contrast. [Citation Graph (, )][DBLP]


  32. A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph. [Citation Graph (, )][DBLP]


  33. Generalized roof duality and bisubmodular functions [Citation Graph (, )][DBLP]


  34. Minimizing a sum of submodular functions [Citation Graph (, )][DBLP]


  35. Submodularity on a tree: Unifying $L^\natural$-convex and bisubmodular functions [Citation Graph (, )][DBLP]


  36. The complexity of conservative finite-valued CSPs [Citation Graph (, )][DBLP]


  37. Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms [Citation Graph (, )][DBLP]


  38. A dichotomy theorem for conservative general-valued CSPs [Citation Graph (, )][DBLP]


Search in 0.097secs, Finished in 0.098secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002