88 Publications

Mark all

[88]
2019 | Journal Article | IST-REx-ID: 7412   OA
D. Achlioptas, F. Iliopoulos, and V. Kolmogorov, “A local lemma for focused stochastical algorithms,” SIAM Journal on Computing, vol. 48, no. 5, pp. 1583–1602, 2019.
View | DOI | Download (ext.) | arXiv
 
[87]
2019 | Conference Paper | IST-REx-ID: 6725   OA
V. Kolmogorov, “Testing the complexity of a valued CSP language,” in 46th International Colloquium on Automata, Languages and Programming, Patras, Greece, 2019, vol. 132, p. 77:1-77:12.
View | Files available | DOI | arXiv
 
[86]
2019 | Conference Paper | IST-REx-ID: 7468   OA
P. Swoboda and V. Kolmogorov, “Map inference via block-coordinate Frank-Wolfe algorithm,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Long Beach, CA, United States, 2019, vol. 2019–June, pp. 11138–11147.
View | DOI | Download (ext.) | arXiv
 
[85]
2019 | Conference Paper | IST-REx-ID: 7639
A. Rannen-Triki, M. Berman, V. Kolmogorov, and M. B. Blaschko, “Function norms for neural networks,” in Proceedings of the 2019 International Conference on Computer Vision Workshop, Seoul, South Korea, 2019, pp. 748–752.
View | DOI
 
[84]
2019 | Journal Article | IST-REx-ID: 6032   OA
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar boolean CSPs,” ACM Transactions on Algorithms, vol. 15, no. 2, p. 22, 2019.
View | Files available | DOI | Download (ext.) | arXiv
 
[83]
2018 | Journal Article | IST-REx-ID: 18   OA
V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” Ars Combinatoria, vol. 141, no. 10, pp. 269–304, 2018.
View | Download (ext.) | arXiv
 
[82]
2018 | Journal Article | IST-REx-ID: 5975
V. Kolmogorov, “Commutativity in the algorithmic Lovász local lemma,” SIAM Journal on Computing, vol. 47, no. 6, pp. 2029–2056, 2018.
View | Files available | DOI | Download (ext.) | arXiv
 
[81]
2018 | Conference Paper | IST-REx-ID: 273   OA
P. Mohapatra, M. Rolinek, C. V. Jawahar, V. Kolmogorov, and M. P. Kumar, “Efficient optimization for rank-based loss functions,” in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, USA, 2018, pp. 3693–3701.
View | DOI | Download (ext.) | arXiv
 
[80]
2017 | Conference Paper | IST-REx-ID: 1192
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 307–326.
View | Files available | DOI | Download (ext.)
 
[79]
2017 | Journal Article | IST-REx-ID: 644   OA
V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” SIAM Journal on Computing, vol. 46, no. 3, pp. 1087–1110, 2017.
View | Files available | DOI | Download (ext.)
 
[78]
2017 | Conference Paper | IST-REx-ID: 274   OA
V. Kolmogorov, “A faster approximation algorithm for the Gibbs partition function,” in Proceedings of the 31st Conference On Learning Theory, 2017, vol. 75, pp. 228–249.
View | Files available | arXiv
 
[77]
2016 | Conference Paper | IST-REx-ID: 1231   OA
J. F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K. Z. Pietrzak, and S. Tessaro, “On the complexity of scrypt and proofs of space in the parallel random oracle model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9666, pp. 358–387.
View | DOI | Download (ext.)
 
[76]
2016 | Journal Article | IST-REx-ID: 1794
V. Kolmogorov and R. Takhanov, “Inference algorithms for pattern-based CRFs on sequence data,” Algorithmica, vol. 76, no. 1, pp. 17–46, 2016.
View | Files available | DOI | Download (ext.) | arXiv
 
[75]
2016 | Conference Paper | IST-REx-ID: 1193   OA
V. Kolmogorov, “Commutativity in the algorithmic Lovasz local lemma,” in Proceedings - Annual IEEE Symposium on Foundations of Computer Science, New Brunswick, NJ, USA , 2016, vol. 2016–December, p. 7782993.
View | Files available | DOI | Download (ext.) | arXiv
 
[74]
2016 | Journal Article | IST-REx-ID: 1377   OA
V. Kolmogorov, T. Pock, and M. Rolinek, “Total variation on a tree,” SIAM Journal on Imaging Sciences, vol. 9, no. 2, pp. 605–636, 2016.
View | DOI | Download (ext.)
 
[73]
2015 | Conference Paper | IST-REx-ID: 1636   OA
V. Kolmogorov, M. Rolinek, and R. Takhanov, “Effectiveness of structural restrictions for hybrid CSPs,” vol. 9472. Springer, pp. 566–577, 2015.
View | DOI | Download (ext.)
 
[72]
2015 | Journal Article | IST-REx-ID: 1841   OA
V. Kolmogorov, “A new look at reweighted message passing,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 5, pp. 919–930, 2015.
View | DOI | Download (ext.)
 
[71]
2015 | Conference Paper | IST-REx-ID: 1675
S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, “Proofs of space,” vol. 9216. Springer, pp. 585–605, 2015.
View | Files available | DOI
 
[70]
2015 | Conference Paper | IST-REx-ID: 1637
V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” presented at the FOCS: Foundations of Computer Science, Berkeley, CA, United States, 2015, pp. 1246–1258.
View | Files available | DOI | Download (ext.)
 
[69]
2015 | Conference Paper | IST-REx-ID: 1859   OA
N. Shah, V. Kolmogorov, and C. Lampert, “A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA, 2015, pp. 2737–2745.
View | DOI | Download (ext.)
 
[68]
2015 | Journal Article | IST-REx-ID: 2271
V. Kolmogorov, J. Thapper, and S. Živný, “The power of linear programming for general-valued CSPs,” SIAM Journal on Computing, vol. 44, no. 1, pp. 1–36, 2015.
View | Files available | DOI | Download (ext.) | arXiv
 
[67]
2014 | Conference Paper | IST-REx-ID: 2275   OA
C. Olsson, J. Ulen, Y. Boykov, and V. Kolmogorov, “Partial enumeration and curvature regularization,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2014, pp. 2936–2943.
View | Files available | DOI
 
[66]
2013 | Conference Paper | IST-REx-ID: 2272   OA
R. Takhanov and V. Kolmogorov, “Inference algorithms for pattern-based CRFs on sequence data,” in ICML’13 Proceedings of the 30th International Conference on International, Atlanta, GA, USA, 2013, vol. 28, no. 3, pp. 145–153.
View | Files available | Download (ext.)
 
[65]
2013 | Conference Paper | IST-REx-ID: 2518   OA
V. Kolmogorov, “The power of linear programming for finite-valued CSPs: A constructive characterization,” presented at the ICALP: Automata, Languages and Programming, Riga, Latvia, 2013, vol. 7965, no. 1, pp. 625–636.
View | Files available | DOI | Download (ext.) | arXiv
 
[64]
2013 | Journal Article | IST-REx-ID: 2828   OA
V. Kolmogorov and S. Živný, “The complexity of conservative valued CSPs,” Journal of the ACM, vol. 60, no. 2, 2013.
View | DOI | Download (ext.) | arXiv
 
[63]
2013 | Report | IST-REx-ID: 2273   OA
V. Kolmogorov, Reweighted message passing revisited. IST Austria, 2013.
View | Download (ext.)
 
[62]
2013 | Conference Paper | IST-REx-ID: 2901   OA
C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, and C. Lampert, “Computing the M most probable modes of a graphical model,” presented at the AISTATS: Conference on Uncertainty in Artificial Intelligence, Scottsdale, AZ, United States, 2013, vol. 31, pp. 161–169.
View | Download (ext.)
 
[61]
2013 | Report | IST-REx-ID: 2274   OA
S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, Proofs of Space. IST Austria, 2013.
View | Files available
 
[60]
2013 | Conference Paper | IST-REx-ID: 2270   OA
Y. Bachrach, P. Kohli, V. Kolmogorov, and M. Zadimoghaddam, “Optimal Coalition Structures in Cooperative Graph Games,” presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States, 2013, pp. 81–87.
View | Download (ext.) | arXiv
 
[59]
2013 | Conference Paper | IST-REx-ID: 2276   OA
I. Gridchyn and V. Kolmogorov, “Potts model, parametric maxflow and k-submodular functions,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 2320–2327.
View | DOI | Download (ext.) | arXiv
 
[58]
2012 | Report | IST-REx-ID: 2929   OA
V. Kolmogorov, The power of linear programming for valued CSPs: a constructive characterization. Unknown, 2012.
View | Download (ext.)
 
[57]
2012 | Journal Article | IST-REx-ID: 2931
L. Torresani, V. Kolmogorov, and C. Rother, “A dual decomposition approach to feature correspondence,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 2, pp. 259–271, 2012.
View | DOI
 
[56]
2012 | Journal Article | IST-REx-ID: 3117   OA
V. Kolmogorov, “Minimizing a sum of submodular functions,” Discrete Applied Mathematics, vol. 160, no. 15, pp. 2246–2258, 2012.
View | DOI | Download (ext.)
 
[55]
2012 | Conference Paper | IST-REx-ID: 3124
F. Korc, V. Kolmogorov, and C. Lampert, “Approximating marginals using discrete energy minimization,” presented at the ICML: International Conference on Machine Learning, Edinburgh, Scotland, 2012.
View | Files available
 
[54]
2012 | Technical Report | IST-REx-ID: 5396   OA
F. Korc, V. Kolmogorov, and C. Lampert, Approximating marginals using discrete energy minimization. IST Austria, 2012.
View | Files available | DOI
 
[53]
2012 | Journal Article | IST-REx-ID: 3257   OA
V. Kolmogorov, “Generalized roof duality and bisubmodular functions,” Discrete Applied Mathematics, vol. 160, no. 4–5, pp. 416–426, 2012.
View | Files available | DOI | Download (ext.) | arXiv
 
[52]
2012 | Conference Paper | IST-REx-ID: 3284   OA
V. Kolmogorov and S. Živný, “The complexity of conservative valued CSPs,” presented at the SODA: Symposium on Discrete Algorithms, 2012, pp. 750–759.
View | Download (ext.)
 
[51]
2012 | Conference Paper | IST-REx-ID: 2930   OA
A. Huber and V. Kolmogorov, “Towards minimizing k-submodular functions,” presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece, 2012, vol. 7422, pp. 451–462.
View | DOI | Download (ext.)
 
[50]
2012 | Preprint | IST-REx-ID: 2928   OA
V. Kolmogorov and T. Schoenemann, “Generalized sequential tree-reweighted message passing,” arXiv. ArXiv, 2012.
View | Download (ext.) | arXiv
 
[49]
2011 | Book Chapter | IST-REx-ID: 2924
A. Criminisi, G. Cross, A. Blake, and V. Kolmogorov, “Bilayer Segmentation of Video,” in Markov Random Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.
View
 
[48]
2011 | Conference Paper | IST-REx-ID: 3206
A. Osokin, D. Vetrov, and V. Kolmogorov, “Submodular decomposition framework for inference in associative Markov networks with global constraints,” presented at the CVPR: Computer Vision and Pattern Recognition, 2011, pp. 1889–1896.
View | DOI | Download (ext.)
 
[47]
2011 | Book Chapter | IST-REx-ID: 2925
C. Rother, V. Kolmogorov, Y. Boykov, and A. Blake, “Interactive Foreground Extraction using graph cut,” in Markov Random Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.
View
 
[46]
2011 | Conference Paper | IST-REx-ID: 3207
S. Vicente, C. Rother, and V. Kolmogorov, “Object cosegmentation,” presented at the CVPR: Computer Vision and Pattern Recognition, 2011, pp. 2217–2224.
View | DOI
 
[45]
2011 | Book Chapter | IST-REx-ID: 2922
S. Vicente, V. Kolmogorov, and C. Rother, “Graph-cut Based Image Segmentation with Connectivity Priors,” in Markov Random Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.
View
 
[44]
2011 | Conference Paper | IST-REx-ID: 3204
V. Kolmogorov, “Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions,” presented at the MFCS: Mathematical Foundations of Computer Science, 2011, vol. 6907, pp. 400–411.
View | DOI | Download (ext.)
 
[43]
2011 | Book Chapter | IST-REx-ID: 2923
M. P. Kumar, V. Kolmogorov, and P. Torr, “Analyzing Convex Relaxations for MAP Estimation,” in Markov Random Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.
View
 
[42]
2011 | Book Chapter | IST-REx-ID: 2935
Y. Boykov and V. Kolmogorov, “Basic graph cut algorithms,” in Markov Random Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011, pp. 31–50.
View
 
[41]
2011 | Conference Paper | IST-REx-ID: 3205
D. Tarlow, D. Batra, P. Kohli, and V. Kolmogorov, “Dynamic tree block coordinate ascent,” presented at the ICML: International Conference on Machine Learning, 2011, pp. 113–120.
View | Download (ext.)
 
[40]
2010 | Conference Paper | IST-REx-ID: 3201
S. Vicente, V. Kolmogorov, and C. Rother, “Cosegmentation revisited: Models and optimization,” presented at the ECCV: European Conference on Computer Vision, 2010, vol. 6312, pp. 465–479.
View | DOI | Download (ext.)
 
[39]
2010 | Journal Article | IST-REx-ID: 3202
V. Kolmogorov, “A faster algorithm for computing the principal sequence of partitions of a graph,” Algorithmica, vol. 56, no. 4, pp. 394–412, 2010.
View | DOI
 
[38]
2010 | Conference Paper | IST-REx-ID: 2934
V. Kolmogorov, “Generalized roof duality and bisubmodular functions,” presented at the Neural Information Processing Systems, 2010.
View | Files available
 
[37]
2009 | Journal Article | IST-REx-ID: 2932
V. Kolmogorov, “Blossom V: A new implementation of a minimum cost perfect matching algorithm,” Mathematical Programming Computation, vol. 1, no. 1, pp. 43–67, 2009.
View | DOI
 
[36]
2009 | Conference Paper | IST-REx-ID: 3199
S. Vicente, V. Kolmogorov, and C. Rother, “Joint optimization of segmentation and appearance models,” presented at the ICCV: International Conference on Computer Vision, 2009, pp. 755–762.
View | DOI | Download (ext.)
 
[35]
2009 | Conference Paper | IST-REx-ID: 3203
O. Woodford, C. Rother, and V. Kolmogorov, “A global perspective on MAP inference for low level vision,” presented at the ICCV: International Conference on Computer Vision, 2009, pp. 2319–2326.
View | DOI
 
[34]
2009 | Journal Article | IST-REx-ID: 3197   OA
M. P. Kumar, V. Kolmogorov, and P. Torr, “An analysis of convex relaxations for MAP estimation of discrete MRFs,” Journal of Machine Learning Research, vol. 10, pp. 71–106, 2009.
View | Download (ext.)
 
[33]
2009 | Journal Article | IST-REx-ID: 3200
V. Kolmogorov and A. Shioura, “New algorithms for convex cost tension problem with application to computer vision,” Discrete Optimization, vol. 6, no. 4, pp. 378–393, 2009.
View | DOI
 
[32]
2008 | Conference Paper | IST-REx-ID: 3198
L. Torresani, V. Kolmogorov, and C. Rother, “Feature correspondence via graph matching: Models and global optimization,” presented at the ECCV: European Conference on Computer Vision, 2008, vol. 5303, pp. 596–609.
View | DOI | Download (ext.)
 
[31]
2008 | Conference Paper | IST-REx-ID: 3194
P. Kohli, A. Shekhovtsov, C. Rother, V. Kolmogorov, and P. Torr, “On partial optimality in multi label MRFs,” presented at the ICML: International Conference on Machine Learning, 2008, pp. 480–487.
View | DOI | Download (ext.)
 
[30]
2008 | Conference Paper | IST-REx-ID: 3195
S. Vicente, V. Kolmogorov, and C. Rother, “Graph cut based image segmentation with connectivity priors,” presented at the CVPR: Computer Vision and Pattern Recognition, 2008.
View | DOI | Download (ext.)
 
[29]
2008 | Journal Article | IST-REx-ID: 3196
R. Szeliski et al., “A comparative study of energy minimization methods for Markov random fields with smoothness-based priors,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 30, no. 6, pp. 1068–1080, 2008.
View | DOI
 
[28]
2007 | Journal Article | IST-REx-ID: 3193
V. Kolmogorov and C. Rother, “Minimizing nonsubmodular functions with graph cuts - A review,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 29, no. 7, pp. 1274–1279, 2007.
View | DOI
 
[27]
2007 | Journal Article | IST-REx-ID: 3187
A. Blake, A. Criminisi, G. Cross, V. Kolmogorov, and C. Rother, “Fusion of stereo colour and contrast,” Springer Tracts in Advanced Robotics, vol. 28, pp. 295–304, 2007.
View | DOI | Download (ext.)
 
[26]
2007 | Conference Paper | IST-REx-ID: 2933
M. P. Kumar, V. Kolmogorov, and P. Torr, “An Analysis of Convex Relaxations for MAP Estimation,” presented at the Neural Information Processing Systems, 2007.
View
 
[25]
2007 | Conference Paper | IST-REx-ID: 3191
V. Kolmogorov, Y. Boykov, and C. Rother, “Applications of parametric maxflow in computer vision,” presented at the ICCV: International Conference on Computer Vision, 2007.
View | DOI | Download (ext.)
 
[24]
2007 | Conference Paper | IST-REx-ID: 3192
C. Rother, V. Kolmogorov, V. Lempitsky, and M. Szummer, “Optimizing binary MRFs via extended roof duality,” presented at the CVPR: Computer Vision and Pattern Recognition, 2007.
View | DOI | Download (ext.)
 
[23]
2006 | Conference Paper | IST-REx-ID: 3186
Y. Boykov, V. Kolmogorov, D. Cremers, and A. Delong, “An integral solution to surface evolution PDEs via geo cuts,” presented at the ECCV: European Conference on Computer Vision, 2006, vol. 3953, pp. 409–422.
View | DOI
 
[22]
2006 | Book Chapter | IST-REx-ID: 2921
V. Kolmogorov and R. Zabih, “Graph cut algorithms for binocular stereo with occlusions,” in Handbook of Mathematical Models in Computer Vision, Springer, 2006, pp. 423–427.
View | DOI
 
[21]
2006 | Conference Paper | IST-REx-ID: 3188
C. Rother, V. Kolmogorov, T. Minka, and A. Blake, “Cosegmentation of image pairs by histogram matching - Incorporating a global constraint into MRFs,” presented at the CVPR: Computer Vision and Pattern Recognition, 2006, pp. 993–1000.
View | DOI
 
[20]
2006 | Journal Article | IST-REx-ID: 3190
V. Kolmogorov, “Convergent tree reweighted message passing for energy minimization,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 10, pp. 1568–1583, 2006.
View | DOI | Download (ext.)
 
[19]
2006 | Conference Paper | IST-REx-ID: 3184
V. Kolmogorov and C. Rother, “Comparison of energy minimization algorithms for highly connected graphs,” presented at the ECCV: European Conference on Computer Vision, 2006, vol. 3952 LNCS, pp. 1–15.
View | DOI | Download (ext.)
 
[18]
2006 | Conference Paper | IST-REx-ID: 3189
A. Criminisi, G. Cross, A. Blake, and V. Kolmogorov, “Bilayer segmentation of live video,” presented at the CVPR: Computer Vision and Pattern Recognition, 2006, vol. 1, pp. 53–60.
View | DOI | Download (ext.)
 
[17]
2006 | Conference Paper | IST-REx-ID: 3180
R. Szeliski et al., “A comparative study of energy minimization methods for Markov random fields,” presented at the ECCV: European Conference on Computer Vision, 2006, vol. 3952, pp. 16–29.
View | DOI | Download (ext.)
 
[16]
2006 | Journal Article | IST-REx-ID: 3185
V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, and C. Rother, “Probabilistic fusion of stereo with color and contrast for bilayer segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 9, pp. 1480–1492, 2006.
View | DOI | Download (ext.)
 
[15]
2005 | Conference Paper | IST-REx-ID: 3181
V. Kolmogorov and M. Wainwright, “On the optimality of tree reweighted max product message passing,” presented at the UAI: Uncertainty in Artificial Intelligence, 2005, pp. 316–323.
View | Download (ext.)
 
[14]
2005 | Conference Paper | IST-REx-ID: 3175
C. Rother, S. Kumar, V. Kolmogorov, and A. Blake, “Digital tapestry,” presented at the CVPR: Computer Vision and Pattern Recognition, 2005, vol. 1, pp. 589–596.
View | DOI | Download (ext.)
 
[13]
2005 | Conference Paper | IST-REx-ID: 3182
V. Kolmogorov and Y. Boykov, “What metrics can be approximated by geo cuts or global optimization of length area and flux,” presented at the ICCV: International Conference on Computer Vision, 2005, vol. 1, pp. 564–571.
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 3176
V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, and C. Rother, “Bi-layer segmentation of binocular stereo video,” presented at the CVPR: Computer Vision and Pattern Recognition, 2005, pp. 1186–1186.
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 3183
V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, and C. Rother, “Bi-layer segmentation of binocular stereo video,” presented at the CVPR: Computer Vision and Pattern Recognition, 2005, vol. 2, pp. 407–414.
View | DOI | Download (ext.)
 
[10]
2004 | Conference Paper | IST-REx-ID: 3179
C. Rother, V. Kolmogorov, and A. Blake, “"GrabCut" - Interactive foreground extraction using iterated graph cuts ,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, 2004, vol. 23, no. 3, pp. 309–314.
View | DOI | Download (ext.)
 
[9]
2004 | Journal Article | IST-REx-ID: 3172
V. Kolmogorov et al., “Multiprocessor scheduling implementation of the simultaneous multiple volume SMV navigator method,” Magnetic Resonance in Medicine, vol. 52, no. 2, pp. 362–367, 2004.
View | DOI
 
[8]
2004 | Conference Paper | IST-REx-ID: 3177
R. Zabih and V. Kolmogorov, “Spatially coherent clustering using graph cuts,” presented at the CVPR: Computer Vision and Pattern Recognition, 2004, vol. 2, pp. 437–444.
View | DOI
 
[7]
2004 | Journal Article | IST-REx-ID: 3173
V. Kolmogorov and R. Zabih, “What energy functions can be minimized via graph cuts? ,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp. 147–159, 2004.
View | DOI
 
[6]
2004 | Journal Article | IST-REx-ID: 3178
Y. Boykov and V. Kolmogorov, “An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 9, pp. 1124–1137, 2004.
View | DOI
 
[5]
2003 | Conference Paper | IST-REx-ID: 3174
J. Kim, V. Kolmogorov, and R. Zabih, “Visual correspondence using energy minimization and mutual information,” presented at the ICCV: International Conference on Computer Vision, 2003, vol. 2, pp. 1033–1040.
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3170
Y. Boykov and V. Kolmogorov, “Computing geodesics and minimal surfaces via graph cuts,” presented at the ICCV: International Conference on Computer Vision, 2003, vol. 1, pp. 26–33.
View | DOI
 
[3]
2003 | Conference Paper | IST-REx-ID: 3171
V. Kolmogorov, R. Zabih, and S. Gortler, “Generalized multi camera scene reconstruction using graph cuts,” presented at the EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, 2003, vol. 2683, pp. 501–516.
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 2927
V. Kolmogorov and R. Zabih, “Multi-camera scene reconstruction via graph cuts,” presented at the ECCV: European Conference on Computer Vision, 2002, pp. 65–81.
View | DOI
 
[1]
2001 | Conference Paper | IST-REx-ID: 3169
V. Kolmogorov and R. Zabih, “Computing visual correspondence with occlusions using graph cuts,” presented at the ICCV: International Conference on Computer Vision, 2001, vol. 2, pp. 508–515.
View | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

88 Publications

Mark all

[88]
2019 | Journal Article | IST-REx-ID: 7412   OA
D. Achlioptas, F. Iliopoulos, and V. Kolmogorov, “A local lemma for focused stochastical algorithms,” SIAM Journal on Computing, vol. 48, no. 5, pp. 1583–1602, 2019.
View | DOI | Download (ext.) | arXiv
 
[87]
2019 | Conference Paper | IST-REx-ID: 6725   OA
V. Kolmogorov, “Testing the complexity of a valued CSP language,” in 46th International Colloquium on Automata, Languages and Programming, Patras, Greece, 2019, vol. 132, p. 77:1-77:12.
View | Files available | DOI | arXiv
 
[86]
2019 | Conference Paper | IST-REx-ID: 7468   OA
P. Swoboda and V. Kolmogorov, “Map inference via block-coordinate Frank-Wolfe algorithm,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Long Beach, CA, United States, 2019, vol. 2019–June, pp. 11138–11147.
View | DOI | Download (ext.) | arXiv
 
[85]
2019 | Conference Paper | IST-REx-ID: 7639
A. Rannen-Triki, M. Berman, V. Kolmogorov, and M. B. Blaschko, “Function norms for neural networks,” in Proceedings of the 2019 International Conference on Computer Vision Workshop, Seoul, South Korea, 2019, pp. 748–752.
View | DOI
 
[84]
2019 | Journal Article | IST-REx-ID: 6032   OA
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar boolean CSPs,” ACM Transactions on Algorithms, vol. 15, no. 2, p. 22, 2019.
View | Files available | DOI | Download (ext.) | arXiv
 
[83]
2018 | Journal Article | IST-REx-ID: 18   OA
V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” Ars Combinatoria, vol. 141, no. 10, pp. 269–304, 2018.
View | Download (ext.) | arXiv
 
[82]
2018 | Journal Article | IST-REx-ID: 5975
V. Kolmogorov, “Commutativity in the algorithmic Lovász local lemma,” SIAM Journal on Computing, vol. 47, no. 6, pp. 2029–2056, 2018.
View | Files available | DOI | Download (ext.) | arXiv
 
[81]
2018 | Conference Paper | IST-REx-ID: 273   OA
P. Mohapatra, M. Rolinek, C. V. Jawahar, V. Kolmogorov, and M. P. Kumar, “Efficient optimization for rank-based loss functions,” in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, USA, 2018, pp. 3693–3701.
View | DOI | Download (ext.) | arXiv
 
[80]
2017 | Conference Paper | IST-REx-ID: 1192
A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar Boolean CSPs,” presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 307–326.
View | Files available | DOI | Download (ext.)
 
[79]
2017 | Journal Article | IST-REx-ID: 644   OA
V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” SIAM Journal on Computing, vol. 46, no. 3, pp. 1087–1110, 2017.
View | Files available | DOI | Download (ext.)
 
[78]
2017 | Conference Paper | IST-REx-ID: 274   OA
V. Kolmogorov, “A faster approximation algorithm for the Gibbs partition function,” in Proceedings of the 31st Conference On Learning Theory, 2017, vol. 75, pp. 228–249.
View | Files available | arXiv
 
[77]
2016 | Conference Paper | IST-REx-ID: 1231   OA
J. F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K. Z. Pietrzak, and S. Tessaro, “On the complexity of scrypt and proofs of space in the parallel random oracle model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9666, pp. 358–387.
View | DOI | Download (ext.)
 
[76]
2016 | Journal Article | IST-REx-ID: 1794
V. Kolmogorov and R. Takhanov, “Inference algorithms for pattern-based CRFs on sequence data,” Algorithmica, vol. 76, no. 1, pp. 17–46, 2016.
View | Files available | DOI | Download (ext.) | arXiv
 
[75]
2016 | Conference Paper | IST-REx-ID: 1193   OA
V. Kolmogorov, “Commutativity in the algorithmic Lovasz local lemma,” in Proceedings - Annual IEEE Symposium on Foundations of Computer Science, New Brunswick, NJ, USA , 2016, vol. 2016–December, p. 7782993.
View | Files available | DOI | Download (ext.) | arXiv
 
[74]
2016 | Journal Article | IST-REx-ID: 1377   OA
V. Kolmogorov, T. Pock, and M. Rolinek, “Total variation on a tree,” SIAM Journal on Imaging Sciences, vol. 9, no. 2, pp. 605–636, 2016.
View | DOI | Download (ext.)
 
[73]
2015 | Conference Paper | IST-REx-ID: 1636   OA
V. Kolmogorov, M. Rolinek, and R. Takhanov, “Effectiveness of structural restrictions for hybrid CSPs,” vol. 9472. Springer, pp. 566–577, 2015.
View | DOI | Download (ext.)
 
[72]
2015 | Journal Article | IST-REx-ID: 1841   OA
V. Kolmogorov, “A new look at reweighted message passing,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 5, pp. 919–930, 2015.
View | DOI | Download (ext.)
 
[71]
2015 | Conference Paper | IST-REx-ID: 1675
S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, “Proofs of space,” vol. 9216. Springer, pp. 585–605, 2015.
View | Files available | DOI
 
[70]
2015 | Conference Paper | IST-REx-ID: 1637
V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” presented at the FOCS: Foundations of Computer Science, Berkeley, CA, United States, 2015, pp. 1246–1258.
View | Files available | DOI | Download (ext.)
 
[69]
2015 | Conference Paper | IST-REx-ID: 1859   OA
N. Shah, V. Kolmogorov, and C. Lampert, “A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA, 2015, pp. 2737–2745.
View | DOI | Download (ext.)
 
[68]
2015 | Journal Article | IST-REx-ID: 2271
V. Kolmogorov, J. Thapper, and S. Živný, “The power of linear programming for general-valued CSPs,” SIAM Journal on Computing, vol. 44, no. 1, pp. 1–36, 2015.
View | Files available | DOI | Download (ext.) | arXiv
 
[67]
2014 | Conference Paper | IST-REx-ID: 2275   OA
C. Olsson, J. Ulen, Y. Boykov, and V. Kolmogorov, “Partial enumeration and curvature regularization,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2014, pp. 2936–2943.
View | Files available | DOI
 
[66]
2013 | Conference Paper | IST-REx-ID: 2272   OA
R. Takhanov and V. Kolmogorov, “Inference algorithms for pattern-based CRFs on sequence data,” in ICML’13 Proceedings of the 30th International Conference on International, Atlanta, GA, USA, 2013, vol. 28, no. 3, pp. 145–153.
View | Files available | Download (ext.)
 
[65]
2013 | Conference Paper | IST-REx-ID: 2518   OA
V. Kolmogorov, “The power of linear programming for finite-valued CSPs: A constructive characterization,” presented at the ICALP: Automata, Languages and Programming, Riga, Latvia, 2013, vol. 7965, no. 1, pp. 625–636.
View | Files available | DOI | Download (ext.) | arXiv
 
[64]
2013 | Journal Article | IST-REx-ID: 2828   OA
V. Kolmogorov and S. Živný, “The complexity of conservative valued CSPs,” Journal of the ACM, vol. 60, no. 2, 2013.
View | DOI | Download (ext.) | arXiv
 
[63]
2013 | Report | IST-REx-ID: 2273   OA
V. Kolmogorov, Reweighted message passing revisited. IST Austria, 2013.
View | Download (ext.)
 
[62]
2013 | Conference Paper | IST-REx-ID: 2901   OA
C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, and C. Lampert, “Computing the M most probable modes of a graphical model,” presented at the AISTATS: Conference on Uncertainty in Artificial Intelligence, Scottsdale, AZ, United States, 2013, vol. 31, pp. 161–169.
View | Download (ext.)
 
[61]
2013 | Report | IST-REx-ID: 2274   OA
S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, Proofs of Space. IST Austria, 2013.
View | Files available
 
[60]
2013 | Conference Paper | IST-REx-ID: 2270   OA
Y. Bachrach, P. Kohli, V. Kolmogorov, and M. Zadimoghaddam, “Optimal Coalition Structures in Cooperative Graph Games,” presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States, 2013, pp. 81–87.
View | Download (ext.) | arXiv
 
[59]
2013 | Conference Paper | IST-REx-ID: 2276   OA
I. Gridchyn and V. Kolmogorov, “Potts model, parametric maxflow and k-submodular functions,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 2320–2327.
View | DOI | Download (ext.) | arXiv
 
[58]
2012 | Report | IST-REx-ID: 2929   OA
V. Kolmogorov, The power of linear programming for valued CSPs: a constructive characterization. Unknown, 2012.
View | Download (ext.)
 
[57]
2012 | Journal Article | IST-REx-ID: 2931
L. Torresani, V. Kolmogorov, and C. Rother, “A dual decomposition approach to feature correspondence,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 2, pp. 259–271, 2012.
View | DOI
 
[56]
2012 | Journal Article | IST-REx-ID: 3117   OA
V. Kolmogorov, “Minimizing a sum of submodular functions,” Discrete Applied Mathematics, vol. 160, no. 15, pp. 2246–2258, 2012.
View | DOI | Download (ext.)
 
[55]
2012 | Conference Paper | IST-REx-ID: 3124
F. Korc, V. Kolmogorov, and C. Lampert, “Approximating marginals using discrete energy minimization,” presented at the ICML: International Conference on Machine Learning, Edinburgh, Scotland, 2012.
View | Files available
 
[54]
2012 | Technical Report | IST-REx-ID: 5396   OA
F. Korc, V. Kolmogorov, and C. Lampert, Approximating marginals using discrete energy minimization. IST Austria, 2012.
View | Files available | DOI
 
[53]
2012 | Journal Article | IST-REx-ID: 3257   OA
V. Kolmogorov, “Generalized roof duality and bisubmodular functions,” Discrete Applied Mathematics, vol. 160, no. 4–5, pp. 416–426, 2012.
View | Files available | DOI | Download (ext.) | arXiv
 
[52]
2012 | Conference Paper | IST-REx-ID: 3284   OA
V. Kolmogorov and S. Živný, “The complexity of conservative valued CSPs,” presented at the SODA: Symposium on Discrete Algorithms, 2012, pp. 750–759.
View | Download (ext.)
 
[51]
2012 | Conference Paper | IST-REx-ID: 2930   OA
A. Huber and V. Kolmogorov, “Towards minimizing k-submodular functions,” presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece, 2012, vol. 7422, pp. 451–462.
View | DOI | Download (ext.)
 
[50]
2012 | Preprint | IST-REx-ID: 2928   OA
V. Kolmogorov and T. Schoenemann, “Generalized sequential tree-reweighted message passing,” arXiv. ArXiv, 2012.
View | Download (ext.) | arXiv
 
[49]
2011 | Book Chapter | IST-REx-ID: 2924
A. Criminisi, G. Cross, A. Blake, and V. Kolmogorov, “Bilayer Segmentation of Video,” in Markov Random Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.
View
 
[48]
2011 | Conference Paper | IST-REx-ID: 3206
A. Osokin, D. Vetrov, and V. Kolmogorov, “Submodular decomposition framework for inference in associative Markov networks with global constraints,” presented at the CVPR: Computer Vision and Pattern Recognition, 2011, pp. 1889–1896.
View | DOI | Download (ext.)
 
[47]
2011 | Book Chapter | IST-REx-ID: 2925
C. Rother, V. Kolmogorov, Y. Boykov, and A. Blake, “Interactive Foreground Extraction using graph cut,” in Markov Random Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.
View
 
[46]
2011 | Conference Paper | IST-REx-ID: 3207
S. Vicente, C. Rother, and V. Kolmogorov, “Object cosegmentation,” presented at the CVPR: Computer Vision and Pattern Recognition, 2011, pp. 2217–2224.
View | DOI
 
[45]
2011 | Book Chapter | IST-REx-ID: 2922
S. Vicente, V. Kolmogorov, and C. Rother, “Graph-cut Based Image Segmentation with Connectivity Priors,” in Markov Random Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.
View
 
[44]
2011 | Conference Paper | IST-REx-ID: 3204
V. Kolmogorov, “Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions,” presented at the MFCS: Mathematical Foundations of Computer Science, 2011, vol. 6907, pp. 400–411.
View | DOI | Download (ext.)
 
[43]
2011 | Book Chapter | IST-REx-ID: 2923
M. P. Kumar, V. Kolmogorov, and P. Torr, “Analyzing Convex Relaxations for MAP Estimation,” in Markov Random Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.
View
 
[42]
2011 | Book Chapter | IST-REx-ID: 2935
Y. Boykov and V. Kolmogorov, “Basic graph cut algorithms,” in Markov Random Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011, pp. 31–50.
View
 
[41]
2011 | Conference Paper | IST-REx-ID: 3205
D. Tarlow, D. Batra, P. Kohli, and V. Kolmogorov, “Dynamic tree block coordinate ascent,” presented at the ICML: International Conference on Machine Learning, 2011, pp. 113–120.
View | Download (ext.)
 
[40]
2010 | Conference Paper | IST-REx-ID: 3201
S. Vicente, V. Kolmogorov, and C. Rother, “Cosegmentation revisited: Models and optimization,” presented at the ECCV: European Conference on Computer Vision, 2010, vol. 6312, pp. 465–479.
View | DOI | Download (ext.)
 
[39]
2010 | Journal Article | IST-REx-ID: 3202
V. Kolmogorov, “A faster algorithm for computing the principal sequence of partitions of a graph,” Algorithmica, vol. 56, no. 4, pp. 394–412, 2010.
View | DOI
 
[38]
2010 | Conference Paper | IST-REx-ID: 2934
V. Kolmogorov, “Generalized roof duality and bisubmodular functions,” presented at the Neural Information Processing Systems, 2010.
View | Files available
 
[37]
2009 | Journal Article | IST-REx-ID: 2932
V. Kolmogorov, “Blossom V: A new implementation of a minimum cost perfect matching algorithm,” Mathematical Programming Computation, vol. 1, no. 1, pp. 43–67, 2009.
View | DOI
 
[36]
2009 | Conference Paper | IST-REx-ID: 3199
S. Vicente, V. Kolmogorov, and C. Rother, “Joint optimization of segmentation and appearance models,” presented at the ICCV: International Conference on Computer Vision, 2009, pp. 755–762.
View | DOI | Download (ext.)
 
[35]
2009 | Conference Paper | IST-REx-ID: 3203
O. Woodford, C. Rother, and V. Kolmogorov, “A global perspective on MAP inference for low level vision,” presented at the ICCV: International Conference on Computer Vision, 2009, pp. 2319–2326.
View | DOI
 
[34]
2009 | Journal Article | IST-REx-ID: 3197   OA
M. P. Kumar, V. Kolmogorov, and P. Torr, “An analysis of convex relaxations for MAP estimation of discrete MRFs,” Journal of Machine Learning Research, vol. 10, pp. 71–106, 2009.
View | Download (ext.)
 
[33]
2009 | Journal Article | IST-REx-ID: 3200
V. Kolmogorov and A. Shioura, “New algorithms for convex cost tension problem with application to computer vision,” Discrete Optimization, vol. 6, no. 4, pp. 378–393, 2009.
View | DOI
 
[32]
2008 | Conference Paper | IST-REx-ID: 3198
L. Torresani, V. Kolmogorov, and C. Rother, “Feature correspondence via graph matching: Models and global optimization,” presented at the ECCV: European Conference on Computer Vision, 2008, vol. 5303, pp. 596–609.
View | DOI | Download (ext.)
 
[31]
2008 | Conference Paper | IST-REx-ID: 3194
P. Kohli, A. Shekhovtsov, C. Rother, V. Kolmogorov, and P. Torr, “On partial optimality in multi label MRFs,” presented at the ICML: International Conference on Machine Learning, 2008, pp. 480–487.
View | DOI | Download (ext.)
 
[30]
2008 | Conference Paper | IST-REx-ID: 3195
S. Vicente, V. Kolmogorov, and C. Rother, “Graph cut based image segmentation with connectivity priors,” presented at the CVPR: Computer Vision and Pattern Recognition, 2008.
View | DOI | Download (ext.)
 
[29]
2008 | Journal Article | IST-REx-ID: 3196
R. Szeliski et al., “A comparative study of energy minimization methods for Markov random fields with smoothness-based priors,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 30, no. 6, pp. 1068–1080, 2008.
View | DOI
 
[28]
2007 | Journal Article | IST-REx-ID: 3193
V. Kolmogorov and C. Rother, “Minimizing nonsubmodular functions with graph cuts - A review,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 29, no. 7, pp. 1274–1279, 2007.
View | DOI
 
[27]
2007 | Journal Article | IST-REx-ID: 3187
A. Blake, A. Criminisi, G. Cross, V. Kolmogorov, and C. Rother, “Fusion of stereo colour and contrast,” Springer Tracts in Advanced Robotics, vol. 28, pp. 295–304, 2007.
View | DOI | Download (ext.)
 
[26]
2007 | Conference Paper | IST-REx-ID: 2933
M. P. Kumar, V. Kolmogorov, and P. Torr, “An Analysis of Convex Relaxations for MAP Estimation,” presented at the Neural Information Processing Systems, 2007.
View
 
[25]
2007 | Conference Paper | IST-REx-ID: 3191
V. Kolmogorov, Y. Boykov, and C. Rother, “Applications of parametric maxflow in computer vision,” presented at the ICCV: International Conference on Computer Vision, 2007.
View | DOI | Download (ext.)
 
[24]
2007 | Conference Paper | IST-REx-ID: 3192
C. Rother, V. Kolmogorov, V. Lempitsky, and M. Szummer, “Optimizing binary MRFs via extended roof duality,” presented at the CVPR: Computer Vision and Pattern Recognition, 2007.
View | DOI | Download (ext.)
 
[23]
2006 | Conference Paper | IST-REx-ID: 3186
Y. Boykov, V. Kolmogorov, D. Cremers, and A. Delong, “An integral solution to surface evolution PDEs via geo cuts,” presented at the ECCV: European Conference on Computer Vision, 2006, vol. 3953, pp. 409–422.
View | DOI
 
[22]
2006 | Book Chapter | IST-REx-ID: 2921
V. Kolmogorov and R. Zabih, “Graph cut algorithms for binocular stereo with occlusions,” in Handbook of Mathematical Models in Computer Vision, Springer, 2006, pp. 423–427.
View | DOI
 
[21]
2006 | Conference Paper | IST-REx-ID: 3188
C. Rother, V. Kolmogorov, T. Minka, and A. Blake, “Cosegmentation of image pairs by histogram matching - Incorporating a global constraint into MRFs,” presented at the CVPR: Computer Vision and Pattern Recognition, 2006, pp. 993–1000.
View | DOI
 
[20]
2006 | Journal Article | IST-REx-ID: 3190
V. Kolmogorov, “Convergent tree reweighted message passing for energy minimization,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 10, pp. 1568–1583, 2006.
View | DOI | Download (ext.)
 
[19]
2006 | Conference Paper | IST-REx-ID: 3184
V. Kolmogorov and C. Rother, “Comparison of energy minimization algorithms for highly connected graphs,” presented at the ECCV: European Conference on Computer Vision, 2006, vol. 3952 LNCS, pp. 1–15.
View | DOI | Download (ext.)
 
[18]
2006 | Conference Paper | IST-REx-ID: 3189
A. Criminisi, G. Cross, A. Blake, and V. Kolmogorov, “Bilayer segmentation of live video,” presented at the CVPR: Computer Vision and Pattern Recognition, 2006, vol. 1, pp. 53–60.
View | DOI | Download (ext.)
 
[17]
2006 | Conference Paper | IST-REx-ID: 3180
R. Szeliski et al., “A comparative study of energy minimization methods for Markov random fields,” presented at the ECCV: European Conference on Computer Vision, 2006, vol. 3952, pp. 16–29.
View | DOI | Download (ext.)
 
[16]
2006 | Journal Article | IST-REx-ID: 3185
V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, and C. Rother, “Probabilistic fusion of stereo with color and contrast for bilayer segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 9, pp. 1480–1492, 2006.
View | DOI | Download (ext.)
 
[15]
2005 | Conference Paper | IST-REx-ID: 3181
V. Kolmogorov and M. Wainwright, “On the optimality of tree reweighted max product message passing,” presented at the UAI: Uncertainty in Artificial Intelligence, 2005, pp. 316–323.
View | Download (ext.)
 
[14]
2005 | Conference Paper | IST-REx-ID: 3175
C. Rother, S. Kumar, V. Kolmogorov, and A. Blake, “Digital tapestry,” presented at the CVPR: Computer Vision and Pattern Recognition, 2005, vol. 1, pp. 589–596.
View | DOI | Download (ext.)
 
[13]
2005 | Conference Paper | IST-REx-ID: 3182
V. Kolmogorov and Y. Boykov, “What metrics can be approximated by geo cuts or global optimization of length area and flux,” presented at the ICCV: International Conference on Computer Vision, 2005, vol. 1, pp. 564–571.
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 3176
V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, and C. Rother, “Bi-layer segmentation of binocular stereo video,” presented at the CVPR: Computer Vision and Pattern Recognition, 2005, pp. 1186–1186.
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 3183
V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, and C. Rother, “Bi-layer segmentation of binocular stereo video,” presented at the CVPR: Computer Vision and Pattern Recognition, 2005, vol. 2, pp. 407–414.
View | DOI | Download (ext.)
 
[10]
2004 | Conference Paper | IST-REx-ID: 3179
C. Rother, V. Kolmogorov, and A. Blake, “"GrabCut" - Interactive foreground extraction using iterated graph cuts ,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, 2004, vol. 23, no. 3, pp. 309–314.
View | DOI | Download (ext.)
 
[9]
2004 | Journal Article | IST-REx-ID: 3172
V. Kolmogorov et al., “Multiprocessor scheduling implementation of the simultaneous multiple volume SMV navigator method,” Magnetic Resonance in Medicine, vol. 52, no. 2, pp. 362–367, 2004.
View | DOI
 
[8]
2004 | Conference Paper | IST-REx-ID: 3177
R. Zabih and V. Kolmogorov, “Spatially coherent clustering using graph cuts,” presented at the CVPR: Computer Vision and Pattern Recognition, 2004, vol. 2, pp. 437–444.
View | DOI
 
[7]
2004 | Journal Article | IST-REx-ID: 3173
V. Kolmogorov and R. Zabih, “What energy functions can be minimized via graph cuts? ,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp. 147–159, 2004.
View | DOI
 
[6]
2004 | Journal Article | IST-REx-ID: 3178
Y. Boykov and V. Kolmogorov, “An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 9, pp. 1124–1137, 2004.
View | DOI
 
[5]
2003 | Conference Paper | IST-REx-ID: 3174
J. Kim, V. Kolmogorov, and R. Zabih, “Visual correspondence using energy minimization and mutual information,” presented at the ICCV: International Conference on Computer Vision, 2003, vol. 2, pp. 1033–1040.
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3170
Y. Boykov and V. Kolmogorov, “Computing geodesics and minimal surfaces via graph cuts,” presented at the ICCV: International Conference on Computer Vision, 2003, vol. 1, pp. 26–33.
View | DOI
 
[3]
2003 | Conference Paper | IST-REx-ID: 3171
V. Kolmogorov, R. Zabih, and S. Gortler, “Generalized multi camera scene reconstruction using graph cuts,” presented at the EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, 2003, vol. 2683, pp. 501–516.
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 2927
V. Kolmogorov and R. Zabih, “Multi-camera scene reconstruction via graph cuts,” presented at the ECCV: European Conference on Computer Vision, 2002, pp. 65–81.
View | DOI
 
[1]
2001 | Conference Paper | IST-REx-ID: 3169
V. Kolmogorov and R. Zabih, “Computing visual correspondence with occlusions using graph cuts,” presented at the ICCV: International Conference on Computer Vision, 2001, vol. 2, pp. 508–515.
View | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed