85 Publications

Mark all

[85]
2019 | Conference Paper | IST-REx-ID: 6725   OA
Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77.
View | Files available | DOI | arXiv
 
[84]
2019 | Journal Article | IST-REx-ID: 6032   OA
Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2019, doi:10.1145/3230649.
View | DOI | Download (ext.) | arXiv
 
[83]
2018 | Journal Article | IST-REx-ID: 18   OA
Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304.
View | Download (ext.) | arXiv
 
[82]
2018 | Journal Article | IST-REx-ID: 5975   OA
Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial & Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306.
View | Files available | DOI | Download (ext.) | arXiv
 
[81]
2018 | Conference Paper | IST-REx-ID: 273   OA
Mohapatra, Pritish, et al. “Efficient Optimization for Rank-Based Loss Functions.” 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–701, doi:10.1109/cvpr.2018.00389.
View | DOI | Download (ext.) | arXiv
 
[80]
2017 | Conference Paper | IST-REx-ID: 1192   OA
Kazda, Alexandr, et al. Even Delta-Matroids and the Complexity of Planar Boolean CSPs. SIAM, 2017, pp. 307–26, doi:10.1137/1.9781611974782.20.
View | DOI | Download (ext.)
 
[79]
2017 | Journal Article | IST-REx-ID: 644   OA
Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.
View | Files available | DOI | Download (ext.)
 
[78]
2017 | Conference Paper | IST-REx-ID: 274   OA
Kolmogorov, Vladimir. A Faster Approximation Algorithm for the Gibbs Partition Function. Unknown, 2017, pp. 1–17.
View | Download (ext.)
 
[77]
2016 | Conference Paper | IST-REx-ID: 1231   OA
Alwen, Joel F., et al. On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. Vol. 9666, Springer, 2016, pp. 358–87, doi:10.1007/978-3-662-49896-5_13.
View | DOI | Download (ext.)
 
[76]
2016 | Journal Article | IST-REx-ID: 1794
Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” Algorithmica, vol. 76, no. 1, Springer, 2016, pp. 17–46, doi:10.1007/s00453-015-0017-7.
View | Files available | DOI | Download (ext.) | arXiv
 
[75]
2016 | Conference Paper | IST-REx-ID: 1193
Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.” Proceedings - Annual IEEE Symposium on Foundations of Computer Science, vol. 2016–December, 7782993, IEEE, 2016, doi:10.1109/FOCS.2016.88.
View | Files available | DOI | Download (ext.)
 
[74]
2016 | Journal Article | IST-REx-ID: 1377   OA
Kolmogorov, Vladimir, et al. “Total Variation on a Tree.” SIAM Journal on Imaging Sciences, vol. 9, no. 2, Society for Industrial and Applied Mathematics , 2016, pp. 605–36, doi:10.1137/15M1010257.
View | DOI | Download (ext.)
 
[73]
2015 | Conference Paper | IST-REx-ID: 1636   OA
Kolmogorov, Vladimir, et al. Effectiveness of Structural Restrictions for Hybrid CSPs. Vol. 9472, Springer, 2015, pp. 566–77, doi:10.1007/978-3-662-48971-0_48.
View | DOI | Download (ext.)
 
[72]
2015 | Journal Article | IST-REx-ID: 1841   OA
Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 5, IEEE, 2015, pp. 919–30, doi:10.1109/TPAMI.2014.2363465.
View | DOI | Download (ext.)
 
[71]
2015 | Conference Paper | IST-REx-ID: 1675
Dziembowski, Stefan, et al. Proofs of Space. Vol. 9216, Springer, 2015, pp. 585–605, doi:10.1007/978-3-662-48000-7_29.
View | Files available | DOI
 
[70]
2015 | Conference Paper | IST-REx-ID: 1637
Kolmogorov, Vladimir, et al. The Complexity of General-Valued CSPs. IEEE, 2015, pp. 1246–58, doi:10.1109/FOCS.2015.80.
View | Files available | DOI | Download (ext.)
 
[69]
2015 | Conference Paper | IST-REx-ID: 1859   OA
Shah, Neel, et al. A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly Max-Oracle. IEEE, 2015, pp. 2737–45, doi:10.1109/CVPR.2015.7298890.
View | DOI | Download (ext.)
 
[68]
2015 | Journal Article | IST-REx-ID: 2271
Kolmogorov, Vladimir, et al. “The Power of Linear Programming for General-Valued CSPs.” SIAM Journal on Computing, vol. 44, no. 1, SIAM, 2015, pp. 1–36, doi:10.1137/130945648.
View | Files available | DOI | Download (ext.) | arXiv
 
[67]
2014 | Conference Paper | IST-REx-ID: 2275   OA
Olsson, Carl, et al. Partial Enumeration and Curvature Regularization. IEEE, 2014, pp. 2936–43, doi:10.1109/ICCV.2013.365.
View | Files available | DOI
 
[66]
2013 | Conference Paper | IST-REx-ID: 2272   OA
Takhanov, Rustem, and Vladimir Kolmogorov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” ICML’13 Proceedings of the 30th International Conference on International, vol. 28, no. 3, International Machine Learning Society, 2013, pp. 145–53.
View | Files available | Download (ext.)
 
[65]
2013 | Conference Paper | IST-REx-ID: 2518   OA
Kolmogorov, Vladimir. The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization. Vol. 7965, no. 1, Springer, 2013, pp. 625–36, doi:10.1007/978-3-642-39206-1_53.
View | Files available | DOI | Download (ext.) | arXiv
 
[64]
2013 | Journal Article | IST-REx-ID: 2828   OA
Kolmogorov, Vladimir, and Stanislav Živný. “The Complexity of Conservative Valued CSPs.” Journal of the ACM, vol. 60, no. 2, 10, ACM, 2013, doi:10.1145/2450142.2450146.
View | DOI | Download (ext.) | arXiv
 
[63]
2013 | Report | IST-REx-ID: 2273   OA
Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013.
View | Download (ext.)
 
[62]
2013 | Conference Paper | IST-REx-ID: 2901   OA
Chen, Chao, et al. Computing the M Most Probable Modes of a Graphical Model. Vol. 31, JMLR, 2013, pp. 161–69.
View | Download (ext.)
 
[61]
2013 | Report | IST-REx-ID: 2274   OA
Dziembowski, Stefan, et al. Proofs of Space. IST Austria, 2013.
View | Files available
 
[60]
2013 | Conference Paper | IST-REx-ID: 2270   OA
Bachrach, Yoram, et al. Optimal Coalition Structures in Cooperative Graph Games. AAAI Press, 2013, pp. 81–87.
View | Download (ext.) | arXiv
 
[59]
2013 | Conference Paper | IST-REx-ID: 2276   OA
Gridchyn, Igor, and Vladimir Kolmogorov. Potts Model, Parametric Maxflow and k-Submodular Functions. IEEE, 2013, pp. 2320–27, doi:10.1109/ICCV.2013.288.
View | DOI | Download (ext.) | arXiv
 
[58]
2012 | Report | IST-REx-ID: 2929   OA
Kolmogorov, Vladimir. The Power of Linear Programming for Valued CSPs: A Constructive Characterization. Unknown, 2012.
View | Download (ext.)
 
[57]
2012 | Journal Article | IST-REx-ID: 2931
Torresani, Lorenzo, et al. “A Dual Decomposition Approach to Feature Correspondence.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 2, IEEE, 2012, pp. 259–71, doi:10.1109/TPAMI.2012.105.
View | DOI
 
[56]
2012 | Journal Article | IST-REx-ID: 3117   OA
Kolmogorov, Vladimir. “Minimizing a Sum of Submodular Functions.” Discrete Applied Mathematics, vol. 160, no. 15, Elsevier, 2012, pp. 2246–58, doi:10.1016/j.dam.2012.05.025.
View | DOI | Download (ext.)
 
[55]
2012 | Conference Paper | IST-REx-ID: 3124
Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization. ICML, 2012.
View | Files available
 
[54]
2012 | Technical Report | IST-REx-ID: 5396   OA
Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization. IST Austria, 2012, doi:10.15479/AT:IST-2012-0003.
View | Files available | DOI
 
[53]
2012 | Journal Article | IST-REx-ID: 3257   OA
Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.” Discrete Applied Mathematics, vol. 160, no. 4–5, Elsevier, 2012, pp. 416–26, doi:10.1016/j.dam.2011.10.026.
View | Files available | DOI | Download (ext.) | arXiv
 
[52]
2012 | Conference Paper | IST-REx-ID: 3284   OA
Kolmogorov, Vladimir, and Stanislav Živný. The Complexity of Conservative Valued CSPs. SIAM, 2012, pp. 750–59.
View | Download (ext.)
 
[51]
2012 | Preprint | IST-REx-ID: 2928   OA
Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” ArXiv, ArXiv, 2012.
View | Download (ext.) | arXiv
 
[50]
2012 | Conference Paper | IST-REx-ID: 2930   OA
Huber, Anna, and Vladimir Kolmogorov. Towards Minimizing K-Submodular Functions. Vol. 7422, Springer, 2012, pp. 451–62, doi:10.1007/978-3-642-32147-4_40.
View | DOI | Download (ext.)
 
[49]
2011 | Book Chapter | IST-REx-ID: 2924
Criminisi, Antonio, et al. “Bilayer Segmentation of Video.” Markov Random Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.
View
 
[48]
2011 | Conference Paper | IST-REx-ID: 3206
Osokin, Anton, et al. Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints. IEEE, 2011, pp. 1889–96, doi:10.1109/CVPR.2011.5995361.
View | DOI | Download (ext.)
 
[47]
2011 | Book Chapter | IST-REx-ID: 2925
Rother, Carsten, et al. “Interactive Foreground Extraction Using Graph Cut.” Markov Random Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.
View
 
[46]
2011 | Conference Paper | IST-REx-ID: 3207
Vicente, Sara, et al. Object Cosegmentation. IEEE, 2011, pp. 2217–24, doi:10.1109/CVPR.2011.5995530.
View | DOI
 
[45]
2011 | Book Chapter | IST-REx-ID: 2922
Vicente, Sara, et al. “Graph-Cut Based Image Segmentation with Connectivity Priors.” Markov Random Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.
View
 
[44]
2011 | Conference Paper | IST-REx-ID: 3204
Kolmogorov, Vladimir. Submodularity on a Tree: Unifying Submodularity on a Tree: Unifying L-Convex and Bisubmodular Functions Convex and Bisubmodular Functions. Vol. 6907, Springer, 2011, pp. 400–11, doi:10.1007/978-3-642-22993-0_37.
View | DOI | Download (ext.)
 
[43]
2011 | Book Chapter | IST-REx-ID: 2923
Kumar, M. Pawan, et al. “Analyzing Convex Relaxations for MAP Estimation.” Markov Random Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.
View
 
[42]
2011 | Book Chapter | IST-REx-ID: 2935
Boykov, Yuri, and Vladimir Kolmogorov. “Basic Graph Cut Algorithms.” Markov Random Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011, pp. 31–50.
View
 
[41]
2011 | Conference Paper | IST-REx-ID: 3205
Tarlow, Daniel, et al. Dynamic Tree Block Coordinate Ascent. Omnipress, 2011, pp. 113–20.
View | Download (ext.)
 
[40]
2010 | Conference Paper | IST-REx-ID: 3201
Vicente, Sara, et al. Cosegmentation Revisited: Models and Optimization. Vol. 6312, Springer, 2010, pp. 465–79, doi:10.1007/978-3-642-15552-9_34.
View | DOI | Download (ext.)
 
[39]
2010 | Journal Article | IST-REx-ID: 3202
Kolmogorov, Vladimir. “A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph.” Algorithmica, vol. 56, no. 4, Springer, 2010, pp. 394–412, doi:10.1007/s00453-008-9177-z.
View | DOI
 
[38]
2010 | Conference Paper | IST-REx-ID: 2934
Kolmogorov, Vladimir. Generalized Roof Duality and Bisubmodular Functions. Neural Information Processing Systems, 2010.
View | Files available
 
[37]
2009 | Journal Article | IST-REx-ID: 2932
Kolmogorov, Vladimir. “Blossom V: A New Implementation of a Minimum Cost Perfect Matching Algorithm.” Mathematical Programming Computation, vol. 1, no. 1, Springer, 2009, pp. 43–67, doi:10.1007/s12532-009-0002-8.
View | DOI
 
[36]
2009 | Conference Paper | IST-REx-ID: 3199
Vicente, Sara, et al. Joint Optimization of Segmentation and Appearance Models. IEEE, 2009, pp. 755–62, doi:10.1109/ICCV.2009.5459287.
View | DOI | Download (ext.)
 
[35]
2009 | Conference Paper | IST-REx-ID: 3203
Woodford, Oliver, et al. A Global Perspective on MAP Inference for Low Level Vision. IEEE, 2009, pp. 2319–26, doi:10.1109/ICCV.2009.5459434.
View | DOI
 
[34]
2009 | Journal Article | IST-REx-ID: 3197   OA
Kumar, M. Pawan, et al. “An Analysis of Convex Relaxations for MAP Estimation of Discrete MRFs.” Journal of Machine Learning Research, vol. 10, Microtome Publishing, 2009, pp. 71–106.
View | Download (ext.)
 
[33]
2009 | Journal Article | IST-REx-ID: 3200
Kolmogorov, Vladimir, and Akiyoshi Shioura. “New Algorithms for Convex Cost Tension Problem with Application to Computer Vision.” Discrete Optimization, vol. 6, no. 4, Elsevier, 2009, pp. 378–93, doi:10.1016/j.disopt.2009.04.006.
View | DOI
 
[32]
2008 | Conference Paper | IST-REx-ID: 3198
Torresani, Lorenzo, et al. Feature Correspondence via Graph Matching: Models and Global Optimization. Vol. 5303, Springer, 2008, pp. 596–609, doi:10.1007/978-3-540-88688-4_44.
View | DOI | Download (ext.)
 
[31]
2008 | Conference Paper | IST-REx-ID: 3194
Kohli, Pushmeet, et al. On Partial Optimality in Multi Label MRFs. Omnipress, 2008, pp. 480–87, doi:10.1145/1390156.1390217.
View | DOI | Download (ext.)
 
[30]
2008 | Conference Paper | IST-REx-ID: 3195
Vicente, Sara, et al. Graph Cut Based Image Segmentation with Connectivity Priors. IEEE, 2008, doi:10.1109/CVPR.2008.4587440.
View | DOI | Download (ext.)
 
[29]
2008 | Journal Article | IST-REx-ID: 3196
Szeliski, Richard, 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, IEEE, 2008, pp. 1068–80, doi:10.1109/TPAMI.2007.70844.
View | DOI
 
[28]
2007 | Journal Article | IST-REx-ID: 3193
Kolmogorov, Vladimir, and Carsten Rother. “Minimizing Nonsubmodular Functions with Graph Cuts - A Review.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 29, no. 7, IEEE, 2007, pp. 1274–79, doi:10.1109/TPAMI.2007.1031.
View | DOI
 
[27]
2007 | Journal Article | IST-REx-ID: 3187
Blake, Andrew, et al. “Fusion of Stereo Colour and Contrast.” Springer Tracts in Advanced Robotics, vol. 28, Springer, 2007, pp. 295–304, doi:10.1007/978-3-540-48113-3_27.
View | DOI | Download (ext.)
 
[26]
2007 | Conference Paper | IST-REx-ID: 2933
Kumar, M. Pawan, et al. An Analysis of Convex Relaxations for MAP Estimation. Neural Information Processing Systems, 2007.
View
 
[25]
2007 | Conference Paper | IST-REx-ID: 3191
Kolmogorov, Vladimir, et al. Applications of Parametric Maxflow in Computer Vision. IEEE, 2007, doi:10.1109/ICCV.2007.4408910.
View | DOI | Download (ext.)
 
[24]
2007 | Conference Paper | IST-REx-ID: 3192
Rother, Carsten, et al. Optimizing Binary MRFs via Extended Roof Duality. IEEE, 2007, doi:10.1109/CVPR.2007.383203.
View | DOI | Download (ext.)
 
[23]
2006 | Conference Paper | IST-REx-ID: 3186
Boykov, Yuri, et al. An Integral Solution to Surface Evolution PDEs via Geo Cuts. Vol. 3953, Springer, 2006, pp. 409–22, doi:10.1007/11744078_32.
View | DOI
 
[22]
2006 | Book Chapter | IST-REx-ID: 2921
Kolmogorov, Vladimir, and Ramin Zabih. “Graph Cut Algorithms for Binocular Stereo with Occlusions.” Handbook of Mathematical Models in Computer Vision, Springer, 2006, pp. 423–27, doi:10.1007/0-387-28831-7_26.
View | DOI
 
[21]
2006 | Conference Paper | IST-REx-ID: 3188
Rother, Carsten, et al. Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs. IEEE, 2006, pp. 993–1000, doi:10.1109/CVPR.2006.91.
View | DOI
 
[20]
2006 | Journal Article | IST-REx-ID: 3190
Kolmogorov, Vladimir. “Convergent Tree Reweighted Message Passing for Energy Minimization.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 10, IEEE, 2006, pp. 1568–83, doi:10.1109/TPAMI.2006.200.
View | DOI | Download (ext.)
 
[19]
2006 | Conference Paper | IST-REx-ID: 3184
Kolmogorov, Vladimir, and Carsten Rother. Comparison of Energy Minimization Algorithms for Highly Connected Graphs. Vol. 3952 LNCS, Springer, 2006, pp. 1–15, doi:10.1007/11744047_1.
View | DOI | Download (ext.)
 
[18]
2006 | Conference Paper | IST-REx-ID: 3189
Criminisi, Antonio, et al. Bilayer Segmentation of Live Video. Vol. 1, IEEE, 2006, pp. 53–60, doi:10.1109/CVPR.2006.69.
View | DOI | Download (ext.)
 
[17]
2006 | Conference Paper | IST-REx-ID: 3180
Szeliski, Richard, et al. A Comparative Study of Energy Minimization Methods for Markov Random Fields. Vol. 3952, Springer, 2006, pp. 16–29, doi:10.1007/11744047_2.
View | DOI | Download (ext.)
 
[16]
2006 | Journal Article | IST-REx-ID: 3185
Kolmogorov, Vladimir, et al. “Probabilistic Fusion of Stereo with Color and Contrast for Bilayer Segmentation.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 9, IEEE, 2006, pp. 1480–92, doi:10.1109/TPAMI.2006.193.
View | DOI | Download (ext.)
 
[15]
2005 | Conference Paper | IST-REx-ID: 3181
Kolmogorov, Vladimir, and Martin Wainwright. On the Optimality of Tree Reweighted Max Product Message Passing. AUAI Press, 2005, pp. 316–23.
View | Download (ext.)
 
[14]
2005 | Conference Paper | IST-REx-ID: 3175
Rother, Carsten, et al. Digital Tapestry. Vol. 1, IEEE, 2005, pp. 589–96, doi:10.1109/CVPR.2005.130.
View | DOI | Download (ext.)
 
[13]
2005 | Conference Paper | IST-REx-ID: 3182
Kolmogorov, Vladimir, and Yuri Boykov. What Metrics Can Be Approximated by Geo Cuts or Global Optimization of Length Area and Flux. Vol. 1, IEEE, 2005, pp. 564–71, doi:10.1109/ICCV.2005.252.
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 3176
Kolmogorov, Vladimir, et al. Bi-Layer Segmentation of Binocular Stereo Video. IEEE, 2005, pp. 1186–1186, doi:10.1109/CVPR.2005.90.
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 3183
Kolmogorov, Vladimir, et al. Bi-Layer Segmentation of Binocular Stereo Video. Vol. 2, IEEE, 2005, pp. 407–14, doi:10.1109/CVPR.2005.91.
View | DOI | Download (ext.)
 
[10]
2004 | Conference Paper | IST-REx-ID: 3179
Rother, Carsten, et al. "GrabCut" - Interactive Foreground Extraction Using Iterated Graph Cuts . Vol. 23, no. 3, ACM, 2004, pp. 309–14, doi:10.1145/1015706.1015720.
View | DOI | Download (ext.)
 
[9]
2004 | Journal Article | IST-REx-ID: 3172
Kolmogorov, Vladimir, et al. “Multiprocessor Scheduling Implementation of the Simultaneous Multiple Volume SMV Navigator Method.” Magnetic Resonance in Medicine, vol. 52, no. 2, Wiley-Blackwell, 2004, pp. 362–67, doi:10.1002/mrm.20162.
View | DOI
 
[8]
2004 | Conference Paper | IST-REx-ID: 3177
Zabih, Ramin, and Vladimir Kolmogorov. Spatially Coherent Clustering Using Graph Cuts. Vol. 2, IEEE, 2004, pp. 437–44, doi:10.1109/CVPR.2004.1315196.
View | DOI
 
[7]
2004 | Journal Article | IST-REx-ID: 3173
Kolmogorov, Vladimir, and Ramin Zabih. “What Energy Functions Can Be Minimized via Graph Cuts? .” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 2, IEEE, 2004, pp. 147–59, doi:10.1109/TPAMI.2004.1262177.
View | DOI
 
[6]
2004 | Journal Article | IST-REx-ID: 3178
Boykov, Yuri, and Vladimir 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, IEEE, 2004, pp. 1124–37, doi:10.1109/TPAMI.2004.60.
View | DOI
 
[5]
2003 | Conference Paper | IST-REx-ID: 3174
Kim, Junhwan, et al. Visual Correspondence Using Energy Minimization and Mutual Information. Vol. 2, IEEE, 2003, pp. 1033–40, doi:10.1109/ICCV.2003.1238463.
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3170
Boykov, Yuri, and Vladimir Kolmogorov. Computing Geodesics and Minimal Surfaces via Graph Cuts. Vol. 1, IEEE, 2003, pp. 26–33, doi:10.1109/ICCV.2003.1238310.
View | DOI
 
[3]
2003 | Conference Paper | IST-REx-ID: 3171
Kolmogorov, Vladimir, et al. Generalized Multi Camera Scene Reconstruction Using Graph Cuts. Vol. 2683, Springer, 2003, pp. 501–16, doi:10.1007/978-3-540-45063-4_32.
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 2927
Kolmogorov, Vladimir, and Ramin Zabih. Multi-Camera Scene Reconstruction via Graph Cuts. Springer, 2002, pp. 65–81, doi:10.1007/3-540-47977-5_5.
View | DOI
 
[1]
2001 | Conference Paper | IST-REx-ID: 3169
Kolmogorov, Vladimir, and Ramin Zabih. Computing Visual Correspondence with Occlusions Using Graph Cuts. Vol. 2, IEEE, 2001, pp. 508–15, doi:10.1109/ICCV.2001.937668.
View | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed

85 Publications

Mark all

[85]
2019 | Conference Paper | IST-REx-ID: 6725   OA
Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77.
View | Files available | DOI | arXiv
 
[84]
2019 | Journal Article | IST-REx-ID: 6032   OA
Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2019, doi:10.1145/3230649.
View | DOI | Download (ext.) | arXiv
 
[83]
2018 | Journal Article | IST-REx-ID: 18   OA
Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304.
View | Download (ext.) | arXiv
 
[82]
2018 | Journal Article | IST-REx-ID: 5975   OA
Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial & Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306.
View | Files available | DOI | Download (ext.) | arXiv
 
[81]
2018 | Conference Paper | IST-REx-ID: 273   OA
Mohapatra, Pritish, et al. “Efficient Optimization for Rank-Based Loss Functions.” 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–701, doi:10.1109/cvpr.2018.00389.
View | DOI | Download (ext.) | arXiv
 
[80]
2017 | Conference Paper | IST-REx-ID: 1192   OA
Kazda, Alexandr, et al. Even Delta-Matroids and the Complexity of Planar Boolean CSPs. SIAM, 2017, pp. 307–26, doi:10.1137/1.9781611974782.20.
View | DOI | Download (ext.)
 
[79]
2017 | Journal Article | IST-REx-ID: 644   OA
Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.
View | Files available | DOI | Download (ext.)
 
[78]
2017 | Conference Paper | IST-REx-ID: 274   OA
Kolmogorov, Vladimir. A Faster Approximation Algorithm for the Gibbs Partition Function. Unknown, 2017, pp. 1–17.
View | Download (ext.)
 
[77]
2016 | Conference Paper | IST-REx-ID: 1231   OA
Alwen, Joel F., et al. On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. Vol. 9666, Springer, 2016, pp. 358–87, doi:10.1007/978-3-662-49896-5_13.
View | DOI | Download (ext.)
 
[76]
2016 | Journal Article | IST-REx-ID: 1794
Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” Algorithmica, vol. 76, no. 1, Springer, 2016, pp. 17–46, doi:10.1007/s00453-015-0017-7.
View | Files available | DOI | Download (ext.) | arXiv
 
[75]
2016 | Conference Paper | IST-REx-ID: 1193
Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.” Proceedings - Annual IEEE Symposium on Foundations of Computer Science, vol. 2016–December, 7782993, IEEE, 2016, doi:10.1109/FOCS.2016.88.
View | Files available | DOI | Download (ext.)
 
[74]
2016 | Journal Article | IST-REx-ID: 1377   OA
Kolmogorov, Vladimir, et al. “Total Variation on a Tree.” SIAM Journal on Imaging Sciences, vol. 9, no. 2, Society for Industrial and Applied Mathematics , 2016, pp. 605–36, doi:10.1137/15M1010257.
View | DOI | Download (ext.)
 
[73]
2015 | Conference Paper | IST-REx-ID: 1636   OA
Kolmogorov, Vladimir, et al. Effectiveness of Structural Restrictions for Hybrid CSPs. Vol. 9472, Springer, 2015, pp. 566–77, doi:10.1007/978-3-662-48971-0_48.
View | DOI | Download (ext.)
 
[72]
2015 | Journal Article | IST-REx-ID: 1841   OA
Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 5, IEEE, 2015, pp. 919–30, doi:10.1109/TPAMI.2014.2363465.
View | DOI | Download (ext.)
 
[71]
2015 | Conference Paper | IST-REx-ID: 1675
Dziembowski, Stefan, et al. Proofs of Space. Vol. 9216, Springer, 2015, pp. 585–605, doi:10.1007/978-3-662-48000-7_29.
View | Files available | DOI
 
[70]
2015 | Conference Paper | IST-REx-ID: 1637
Kolmogorov, Vladimir, et al. The Complexity of General-Valued CSPs. IEEE, 2015, pp. 1246–58, doi:10.1109/FOCS.2015.80.
View | Files available | DOI | Download (ext.)
 
[69]
2015 | Conference Paper | IST-REx-ID: 1859   OA
Shah, Neel, et al. A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly Max-Oracle. IEEE, 2015, pp. 2737–45, doi:10.1109/CVPR.2015.7298890.
View | DOI | Download (ext.)
 
[68]
2015 | Journal Article | IST-REx-ID: 2271
Kolmogorov, Vladimir, et al. “The Power of Linear Programming for General-Valued CSPs.” SIAM Journal on Computing, vol. 44, no. 1, SIAM, 2015, pp. 1–36, doi:10.1137/130945648.
View | Files available | DOI | Download (ext.) | arXiv
 
[67]
2014 | Conference Paper | IST-REx-ID: 2275   OA
Olsson, Carl, et al. Partial Enumeration and Curvature Regularization. IEEE, 2014, pp. 2936–43, doi:10.1109/ICCV.2013.365.
View | Files available | DOI
 
[66]
2013 | Conference Paper | IST-REx-ID: 2272   OA
Takhanov, Rustem, and Vladimir Kolmogorov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” ICML’13 Proceedings of the 30th International Conference on International, vol. 28, no. 3, International Machine Learning Society, 2013, pp. 145–53.
View | Files available | Download (ext.)
 
[65]
2013 | Conference Paper | IST-REx-ID: 2518   OA
Kolmogorov, Vladimir. The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization. Vol. 7965, no. 1, Springer, 2013, pp. 625–36, doi:10.1007/978-3-642-39206-1_53.
View | Files available | DOI | Download (ext.) | arXiv
 
[64]
2013 | Journal Article | IST-REx-ID: 2828   OA
Kolmogorov, Vladimir, and Stanislav Živný. “The Complexity of Conservative Valued CSPs.” Journal of the ACM, vol. 60, no. 2, 10, ACM, 2013, doi:10.1145/2450142.2450146.
View | DOI | Download (ext.) | arXiv
 
[63]
2013 | Report | IST-REx-ID: 2273   OA
Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013.
View | Download (ext.)
 
[62]
2013 | Conference Paper | IST-REx-ID: 2901   OA
Chen, Chao, et al. Computing the M Most Probable Modes of a Graphical Model. Vol. 31, JMLR, 2013, pp. 161–69.
View | Download (ext.)
 
[61]
2013 | Report | IST-REx-ID: 2274   OA
Dziembowski, Stefan, et al. Proofs of Space. IST Austria, 2013.
View | Files available
 
[60]
2013 | Conference Paper | IST-REx-ID: 2270   OA
Bachrach, Yoram, et al. Optimal Coalition Structures in Cooperative Graph Games. AAAI Press, 2013, pp. 81–87.
View | Download (ext.) | arXiv
 
[59]
2013 | Conference Paper | IST-REx-ID: 2276   OA
Gridchyn, Igor, and Vladimir Kolmogorov. Potts Model, Parametric Maxflow and k-Submodular Functions. IEEE, 2013, pp. 2320–27, doi:10.1109/ICCV.2013.288.
View | DOI | Download (ext.) | arXiv
 
[58]
2012 | Report | IST-REx-ID: 2929   OA
Kolmogorov, Vladimir. The Power of Linear Programming for Valued CSPs: A Constructive Characterization. Unknown, 2012.
View | Download (ext.)
 
[57]
2012 | Journal Article | IST-REx-ID: 2931
Torresani, Lorenzo, et al. “A Dual Decomposition Approach to Feature Correspondence.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 2, IEEE, 2012, pp. 259–71, doi:10.1109/TPAMI.2012.105.
View | DOI
 
[56]
2012 | Journal Article | IST-REx-ID: 3117   OA
Kolmogorov, Vladimir. “Minimizing a Sum of Submodular Functions.” Discrete Applied Mathematics, vol. 160, no. 15, Elsevier, 2012, pp. 2246–58, doi:10.1016/j.dam.2012.05.025.
View | DOI | Download (ext.)
 
[55]
2012 | Conference Paper | IST-REx-ID: 3124
Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization. ICML, 2012.
View | Files available
 
[54]
2012 | Technical Report | IST-REx-ID: 5396   OA
Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization. IST Austria, 2012, doi:10.15479/AT:IST-2012-0003.
View | Files available | DOI
 
[53]
2012 | Journal Article | IST-REx-ID: 3257   OA
Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.” Discrete Applied Mathematics, vol. 160, no. 4–5, Elsevier, 2012, pp. 416–26, doi:10.1016/j.dam.2011.10.026.
View | Files available | DOI | Download (ext.) | arXiv
 
[52]
2012 | Conference Paper | IST-REx-ID: 3284   OA
Kolmogorov, Vladimir, and Stanislav Živný. The Complexity of Conservative Valued CSPs. SIAM, 2012, pp. 750–59.
View | Download (ext.)
 
[51]
2012 | Preprint | IST-REx-ID: 2928   OA
Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” ArXiv, ArXiv, 2012.
View | Download (ext.) | arXiv
 
[50]
2012 | Conference Paper | IST-REx-ID: 2930   OA
Huber, Anna, and Vladimir Kolmogorov. Towards Minimizing K-Submodular Functions. Vol. 7422, Springer, 2012, pp. 451–62, doi:10.1007/978-3-642-32147-4_40.
View | DOI | Download (ext.)
 
[49]
2011 | Book Chapter | IST-REx-ID: 2924
Criminisi, Antonio, et al. “Bilayer Segmentation of Video.” Markov Random Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.
View
 
[48]
2011 | Conference Paper | IST-REx-ID: 3206
Osokin, Anton, et al. Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints. IEEE, 2011, pp. 1889–96, doi:10.1109/CVPR.2011.5995361.
View | DOI | Download (ext.)
 
[47]
2011 | Book Chapter | IST-REx-ID: 2925
Rother, Carsten, et al. “Interactive Foreground Extraction Using Graph Cut.” Markov Random Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.
View
 
[46]
2011 | Conference Paper | IST-REx-ID: 3207
Vicente, Sara, et al. Object Cosegmentation. IEEE, 2011, pp. 2217–24, doi:10.1109/CVPR.2011.5995530.
View | DOI
 
[45]
2011 | Book Chapter | IST-REx-ID: 2922
Vicente, Sara, et al. “Graph-Cut Based Image Segmentation with Connectivity Priors.” Markov Random Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.
View
 
[44]
2011 | Conference Paper | IST-REx-ID: 3204
Kolmogorov, Vladimir. Submodularity on a Tree: Unifying Submodularity on a Tree: Unifying L-Convex and Bisubmodular Functions Convex and Bisubmodular Functions. Vol. 6907, Springer, 2011, pp. 400–11, doi:10.1007/978-3-642-22993-0_37.
View | DOI | Download (ext.)
 
[43]
2011 | Book Chapter | IST-REx-ID: 2923
Kumar, M. Pawan, et al. “Analyzing Convex Relaxations for MAP Estimation.” Markov Random Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.
View
 
[42]
2011 | Book Chapter | IST-REx-ID: 2935
Boykov, Yuri, and Vladimir Kolmogorov. “Basic Graph Cut Algorithms.” Markov Random Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011, pp. 31–50.
View
 
[41]
2011 | Conference Paper | IST-REx-ID: 3205
Tarlow, Daniel, et al. Dynamic Tree Block Coordinate Ascent. Omnipress, 2011, pp. 113–20.
View | Download (ext.)
 
[40]
2010 | Conference Paper | IST-REx-ID: 3201
Vicente, Sara, et al. Cosegmentation Revisited: Models and Optimization. Vol. 6312, Springer, 2010, pp. 465–79, doi:10.1007/978-3-642-15552-9_34.
View | DOI | Download (ext.)
 
[39]
2010 | Journal Article | IST-REx-ID: 3202
Kolmogorov, Vladimir. “A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph.” Algorithmica, vol. 56, no. 4, Springer, 2010, pp. 394–412, doi:10.1007/s00453-008-9177-z.
View | DOI
 
[38]
2010 | Conference Paper | IST-REx-ID: 2934
Kolmogorov, Vladimir. Generalized Roof Duality and Bisubmodular Functions. Neural Information Processing Systems, 2010.
View | Files available
 
[37]
2009 | Journal Article | IST-REx-ID: 2932
Kolmogorov, Vladimir. “Blossom V: A New Implementation of a Minimum Cost Perfect Matching Algorithm.” Mathematical Programming Computation, vol. 1, no. 1, Springer, 2009, pp. 43–67, doi:10.1007/s12532-009-0002-8.
View | DOI
 
[36]
2009 | Conference Paper | IST-REx-ID: 3199
Vicente, Sara, et al. Joint Optimization of Segmentation and Appearance Models. IEEE, 2009, pp. 755–62, doi:10.1109/ICCV.2009.5459287.
View | DOI | Download (ext.)
 
[35]
2009 | Conference Paper | IST-REx-ID: 3203
Woodford, Oliver, et al. A Global Perspective on MAP Inference for Low Level Vision. IEEE, 2009, pp. 2319–26, doi:10.1109/ICCV.2009.5459434.
View | DOI
 
[34]
2009 | Journal Article | IST-REx-ID: 3197   OA
Kumar, M. Pawan, et al. “An Analysis of Convex Relaxations for MAP Estimation of Discrete MRFs.” Journal of Machine Learning Research, vol. 10, Microtome Publishing, 2009, pp. 71–106.
View | Download (ext.)
 
[33]
2009 | Journal Article | IST-REx-ID: 3200
Kolmogorov, Vladimir, and Akiyoshi Shioura. “New Algorithms for Convex Cost Tension Problem with Application to Computer Vision.” Discrete Optimization, vol. 6, no. 4, Elsevier, 2009, pp. 378–93, doi:10.1016/j.disopt.2009.04.006.
View | DOI
 
[32]
2008 | Conference Paper | IST-REx-ID: 3198
Torresani, Lorenzo, et al. Feature Correspondence via Graph Matching: Models and Global Optimization. Vol. 5303, Springer, 2008, pp. 596–609, doi:10.1007/978-3-540-88688-4_44.
View | DOI | Download (ext.)
 
[31]
2008 | Conference Paper | IST-REx-ID: 3194
Kohli, Pushmeet, et al. On Partial Optimality in Multi Label MRFs. Omnipress, 2008, pp. 480–87, doi:10.1145/1390156.1390217.
View | DOI | Download (ext.)
 
[30]
2008 | Conference Paper | IST-REx-ID: 3195
Vicente, Sara, et al. Graph Cut Based Image Segmentation with Connectivity Priors. IEEE, 2008, doi:10.1109/CVPR.2008.4587440.
View | DOI | Download (ext.)
 
[29]
2008 | Journal Article | IST-REx-ID: 3196
Szeliski, Richard, 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, IEEE, 2008, pp. 1068–80, doi:10.1109/TPAMI.2007.70844.
View | DOI
 
[28]
2007 | Journal Article | IST-REx-ID: 3193
Kolmogorov, Vladimir, and Carsten Rother. “Minimizing Nonsubmodular Functions with Graph Cuts - A Review.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 29, no. 7, IEEE, 2007, pp. 1274–79, doi:10.1109/TPAMI.2007.1031.
View | DOI
 
[27]
2007 | Journal Article | IST-REx-ID: 3187
Blake, Andrew, et al. “Fusion of Stereo Colour and Contrast.” Springer Tracts in Advanced Robotics, vol. 28, Springer, 2007, pp. 295–304, doi:10.1007/978-3-540-48113-3_27.
View | DOI | Download (ext.)
 
[26]
2007 | Conference Paper | IST-REx-ID: 2933
Kumar, M. Pawan, et al. An Analysis of Convex Relaxations for MAP Estimation. Neural Information Processing Systems, 2007.
View
 
[25]
2007 | Conference Paper | IST-REx-ID: 3191
Kolmogorov, Vladimir, et al. Applications of Parametric Maxflow in Computer Vision. IEEE, 2007, doi:10.1109/ICCV.2007.4408910.
View | DOI | Download (ext.)
 
[24]
2007 | Conference Paper | IST-REx-ID: 3192
Rother, Carsten, et al. Optimizing Binary MRFs via Extended Roof Duality. IEEE, 2007, doi:10.1109/CVPR.2007.383203.
View | DOI | Download (ext.)
 
[23]
2006 | Conference Paper | IST-REx-ID: 3186
Boykov, Yuri, et al. An Integral Solution to Surface Evolution PDEs via Geo Cuts. Vol. 3953, Springer, 2006, pp. 409–22, doi:10.1007/11744078_32.
View | DOI
 
[22]
2006 | Book Chapter | IST-REx-ID: 2921
Kolmogorov, Vladimir, and Ramin Zabih. “Graph Cut Algorithms for Binocular Stereo with Occlusions.” Handbook of Mathematical Models in Computer Vision, Springer, 2006, pp. 423–27, doi:10.1007/0-387-28831-7_26.
View | DOI
 
[21]
2006 | Conference Paper | IST-REx-ID: 3188
Rother, Carsten, et al. Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs. IEEE, 2006, pp. 993–1000, doi:10.1109/CVPR.2006.91.
View | DOI
 
[20]
2006 | Journal Article | IST-REx-ID: 3190
Kolmogorov, Vladimir. “Convergent Tree Reweighted Message Passing for Energy Minimization.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 10, IEEE, 2006, pp. 1568–83, doi:10.1109/TPAMI.2006.200.
View | DOI | Download (ext.)
 
[19]
2006 | Conference Paper | IST-REx-ID: 3184
Kolmogorov, Vladimir, and Carsten Rother. Comparison of Energy Minimization Algorithms for Highly Connected Graphs. Vol. 3952 LNCS, Springer, 2006, pp. 1–15, doi:10.1007/11744047_1.
View | DOI | Download (ext.)
 
[18]
2006 | Conference Paper | IST-REx-ID: 3189
Criminisi, Antonio, et al. Bilayer Segmentation of Live Video. Vol. 1, IEEE, 2006, pp. 53–60, doi:10.1109/CVPR.2006.69.
View | DOI | Download (ext.)
 
[17]
2006 | Conference Paper | IST-REx-ID: 3180
Szeliski, Richard, et al. A Comparative Study of Energy Minimization Methods for Markov Random Fields. Vol. 3952, Springer, 2006, pp. 16–29, doi:10.1007/11744047_2.
View | DOI | Download (ext.)
 
[16]
2006 | Journal Article | IST-REx-ID: 3185
Kolmogorov, Vladimir, et al. “Probabilistic Fusion of Stereo with Color and Contrast for Bilayer Segmentation.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 9, IEEE, 2006, pp. 1480–92, doi:10.1109/TPAMI.2006.193.
View | DOI | Download (ext.)
 
[15]
2005 | Conference Paper | IST-REx-ID: 3181
Kolmogorov, Vladimir, and Martin Wainwright. On the Optimality of Tree Reweighted Max Product Message Passing. AUAI Press, 2005, pp. 316–23.
View | Download (ext.)
 
[14]
2005 | Conference Paper | IST-REx-ID: 3175
Rother, Carsten, et al. Digital Tapestry. Vol. 1, IEEE, 2005, pp. 589–96, doi:10.1109/CVPR.2005.130.
View | DOI | Download (ext.)
 
[13]
2005 | Conference Paper | IST-REx-ID: 3182
Kolmogorov, Vladimir, and Yuri Boykov. What Metrics Can Be Approximated by Geo Cuts or Global Optimization of Length Area and Flux. Vol. 1, IEEE, 2005, pp. 564–71, doi:10.1109/ICCV.2005.252.
View | DOI
 
[12]
2005 | Conference Paper | IST-REx-ID: 3176
Kolmogorov, Vladimir, et al. Bi-Layer Segmentation of Binocular Stereo Video. IEEE, 2005, pp. 1186–1186, doi:10.1109/CVPR.2005.90.
View | DOI
 
[11]
2005 | Conference Paper | IST-REx-ID: 3183
Kolmogorov, Vladimir, et al. Bi-Layer Segmentation of Binocular Stereo Video. Vol. 2, IEEE, 2005, pp. 407–14, doi:10.1109/CVPR.2005.91.
View | DOI | Download (ext.)
 
[10]
2004 | Conference Paper | IST-REx-ID: 3179
Rother, Carsten, et al. "GrabCut" - Interactive Foreground Extraction Using Iterated Graph Cuts . Vol. 23, no. 3, ACM, 2004, pp. 309–14, doi:10.1145/1015706.1015720.
View | DOI | Download (ext.)
 
[9]
2004 | Journal Article | IST-REx-ID: 3172
Kolmogorov, Vladimir, et al. “Multiprocessor Scheduling Implementation of the Simultaneous Multiple Volume SMV Navigator Method.” Magnetic Resonance in Medicine, vol. 52, no. 2, Wiley-Blackwell, 2004, pp. 362–67, doi:10.1002/mrm.20162.
View | DOI
 
[8]
2004 | Conference Paper | IST-REx-ID: 3177
Zabih, Ramin, and Vladimir Kolmogorov. Spatially Coherent Clustering Using Graph Cuts. Vol. 2, IEEE, 2004, pp. 437–44, doi:10.1109/CVPR.2004.1315196.
View | DOI
 
[7]
2004 | Journal Article | IST-REx-ID: 3173
Kolmogorov, Vladimir, and Ramin Zabih. “What Energy Functions Can Be Minimized via Graph Cuts? .” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 2, IEEE, 2004, pp. 147–59, doi:10.1109/TPAMI.2004.1262177.
View | DOI
 
[6]
2004 | Journal Article | IST-REx-ID: 3178
Boykov, Yuri, and Vladimir 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, IEEE, 2004, pp. 1124–37, doi:10.1109/TPAMI.2004.60.
View | DOI
 
[5]
2003 | Conference Paper | IST-REx-ID: 3174
Kim, Junhwan, et al. Visual Correspondence Using Energy Minimization and Mutual Information. Vol. 2, IEEE, 2003, pp. 1033–40, doi:10.1109/ICCV.2003.1238463.
View | DOI
 
[4]
2003 | Conference Paper | IST-REx-ID: 3170
Boykov, Yuri, and Vladimir Kolmogorov. Computing Geodesics and Minimal Surfaces via Graph Cuts. Vol. 1, IEEE, 2003, pp. 26–33, doi:10.1109/ICCV.2003.1238310.
View | DOI
 
[3]
2003 | Conference Paper | IST-REx-ID: 3171
Kolmogorov, Vladimir, et al. Generalized Multi Camera Scene Reconstruction Using Graph Cuts. Vol. 2683, Springer, 2003, pp. 501–16, doi:10.1007/978-3-540-45063-4_32.
View | DOI
 
[2]
2002 | Conference Paper | IST-REx-ID: 2927
Kolmogorov, Vladimir, and Ramin Zabih. Multi-Camera Scene Reconstruction via Graph Cuts. Springer, 2002, pp. 65–81, doi:10.1007/3-540-47977-5_5.
View | DOI
 
[1]
2001 | Conference Paper | IST-REx-ID: 3169
Kolmogorov, Vladimir, and Ramin Zabih. Computing Visual Correspondence with Occlusions Using Graph Cuts. Vol. 2, IEEE, 2001, pp. 508–15, doi:10.1109/ICCV.2001.937668.
View | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed