暂无分享,去创建一个
Suvrit Sra | Francis R. Bach | Stefanie Jegelka | K. S. Sesh Kumar | Álvaro Barbero Jiménez | F. Bach | S. Sra | S. Jegelka | Á. Jiménez | K. S. S. Kumar
[1] Vladimir Kolmogorov,et al. Optimizing Binary MRFs via Extended Roof Duality , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.
[2] Dhruv Batra,et al. MaxFlow Revisited: An Empirical Comparison of Maxflow Algorithms for Dense Vision Problems , 2012, BMVC.
[3] Dorit S. Hochbaum,et al. A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant , 2013, Oper. Res..
[4] Marc Teboulle,et al. A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..
[5] Markus Grasmair,et al. The Equivalence of the Taut String Algorithm and BV-Regularization , 2006, Journal of Mathematical Imaging and Vision.
[6] Fredrik Kahl,et al. Parallel and distributed graph cuts by dual decomposition , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[7] Francis R. Bach,et al. Learning with Submodular Functions: A Convex Optimization Perspective , 2011, Found. Trends Mach. Learn..
[8] Christoph Schnörr,et al. A study of Nesterov's scheme for Lagrangian decomposition and MAP labeling , 2011, CVPR 2011.
[9] Pushmeet Kohli,et al. P³ & Beyond: Move Making Algorithms for Solving Higher Order Functions , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[10] Antonin Chambolle,et al. On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows , 2009, International Journal of Computer Vision.
[11] Amir Beck,et al. On the Convergence of Block Coordinate Descent Type Methods , 2013, SIAM J. Optim..
[12] Pushmeet Kohli,et al. Robust Higher Order Potentials for Enforcing Label Consistency , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[13] Nicholas A. Johnson,et al. A Dynamic Programming Algorithm for the Fused Lasso and L 0-Segmentation , 2013 .
[14] Dorit S. Hochbaum,et al. A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem , 2009, Oper. Res..
[15] Dorit S. Hochbaum,et al. About strongly polynomial time algorithms for quadratic optimization over submodular constraints , 1995, Math. Program..
[16] Olga Veksler,et al. Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[17] Matthias Hein,et al. The Total Variation on Hypergraphs - Learning on Hypergraphs Revisited , 2013, NIPS.
[18] Laurent Condat,et al. A Direct Algorithm for 1-D Total Variation Denoising , 2013, IEEE Signal Processing Letters.
[19] Andreas Krause,et al. Efficient Minimization of Decomposable Submodular Functions , 2010, NIPS.
[20] Tommi S. Jaakkola,et al. Tree Block Coordinate Descent for MAP in Graphical Models , 2009, AISTATS.
[21] Heinz H. Bauschke,et al. Finding best approximation pairs relative to two closed convex sets in Hilbert spaces , 2004, J. Approx. Theory.
[22] Michael I. Jordan,et al. On the Convergence Rate of Decomposable Submodular Function Minimization , 2014, NIPS.
[23] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[24] Peter Richtárik,et al. Parallel coordinate descent methods for big data optimization , 2012, Mathematical Programming.
[25] Nikos Komodakis,et al. MRF Energy Minimization and Beyond via Dual Decomposition , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[26] K. Schittkowski,et al. NONLINEAR PROGRAMMING , 2022 .
[27] Vladimir Kolmogorov,et al. Minimizing a sum of submodular functions , 2010, Discret. Appl. Math..
[28] Vladimir Kolmogorov,et al. Applications of parametric maxflow in computer vision , 2007, 2007 IEEE 11th International Conference on Computer Vision.
[29] Huy L. Nguyen,et al. Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions , 2015, ICML.
[30] P. Kohli,et al. Efficiently solving dynamic Markov random fields using graph cuts , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.
[31] S HochbaumDorit. An efficient algorithm for image segmentation, Markov random fields and related problems , 2001 .
[32] Kazuyuki Aihara,et al. Size-constrained Submodular Minimization through Minimum Norm Base , 2011, ICML.
[33] Haim Kaplan,et al. Maximum Flows by Incremental Breadth-First Search , 2011, ESA.
[34] Suvrit Sra,et al. Reflection methods for user-friendly submodular optimization , 2013, NIPS.
[35] Vladimir Kolmogorov,et al. Convergent Tree-Reweighted Message Passing for Energy Minimization , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[36] Pushmeet Kohli,et al. Markov Random Fields for Vision and Image Processing , 2011 .
[37] 藤重 悟. Submodular functions and optimization , 1991 .
[38] Stephen P. Boyd,et al. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..
[39] H. D. Ratliff,et al. Minimum cuts and related problems , 1975, Networks.
[40] Sebastian Nowozin,et al. A Comparative Study of Modern Inference Techniques for Discrete Energy Minimization Problems , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.
[41] Vladimir Kolmogorov,et al. An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.