Optimizing Binary MRFs via Extended Roof Duality
暂无分享,去创建一个
Vladimir Kolmogorov | Carsten Rother | Martin Szummer | Victor S. Lempitsky | C. Rother | M. Szummer | V. Lempitsky | V. Kolmogorov
[1] Robert E. Tarjan,et al. A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..
[2] Pierre Hansen,et al. Roof duality, complementation and persistency in quadratic 0–1 optimization , 1984, Math. Program..
[3] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[4] William A. Barrett,et al. Intelligent scissors for image composition , 1995, SIGGRAPH.
[5] John E. Beasley,et al. Heuristic algorithms for the unconstrained binary quadratic programming problem , 1998 .
[6] Olga Veksler,et al. Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[7] Marie-Pierre Jolly,et al. Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images , 2001, ICCV.
[8] Y.Y. Boykov,et al. Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.
[9] Olga Veksler,et al. Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..
[10] Endre Boros,et al. Pseudo-Boolean optimization , 2002, Discret. Appl. Math..
[11] Yuan Qi,et al. Contextual recognition of hand-drawn diagrams with conditional random fields , 2004, Ninth International Workshop on Frontiers in Handwriting Recognition.
[12] 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.
[13] William T. Freeman,et al. c ○ 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Learning Low-Level Vision , 2022 .
[14] Andrew Blake,et al. Digital tapestry [automatic image synthesis] , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).
[15] Martin J. Wainwright,et al. On the Optimality of Tree-reweighted Max-product Message-passing , 2005, UAI.
[16] Hans L. Bodlaender,et al. Discovering Treewidth , 2005, SOFSEM.
[17] 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.
[18] Andrew W. Fitzgibbon,et al. Image-Based Rendering Using Image-Based Priors , 2005, International Journal of Computer Vision.
[19] Ashish Raj,et al. A graph cut algorithm for generalized image deconvolution , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.
[20] Daniel Cremers,et al. Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts , 2006, ECCV.
[21] Richard Szeliski,et al. A Comparative Study of Energy Minimization Methods for Markov Random Fields , 2006, ECCV.
[22] Gurmeet Singh,et al. MRF's forMRI's: Bayesian Reconstruction of MR Images via Graph Cuts , 2006, CVPR.
[23] Vladimir Kolmogorov,et al. Convergent Tree-Reweighted Message Passing for Energy Minimization , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[24] Endre Boros,et al. Preprocessing of unconstrained quadratic binary optimization , 2006 .
[25] Vladimir Kolmogorov,et al. Minimizing Nonsubmodular Functions with Graph Cuts-A Review , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[26] Endre Boros,et al. Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO) , 2007, J. Heuristics.