Generalized roof duality and bisubmodular functions
暂无分享,去创建一个
[1] Aly A. Farag,et al. Optimizing Binary MRFs with Higher Order Cliques , 2008, ECCV.
[2] D. SIAMJ.. BISUBMODULAR FUNCTION MINIMIZATION∗ , 2006 .
[3] Vladimir Kolmogorov,et al. Optimizing Binary MRFs via Extended Roof Duality , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.
[4] Hiroshi Ishikawa. Higher-order gradient descent by fusion-move graph cut , 2009, 2009 IEEE 12th International Conference on Computer Vision.
[5] Olga Veksler,et al. Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[6] Ramaswamy Chandrasekaran,et al. On totally dual integral systems , 1990, Discret. Appl. Math..
[7] Andrew W. Fitzgibbon,et al. Global stereo reconstruction under second order smoothness priors , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[8] William H. Cunningham,et al. Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra , 1995, SIAM J. Discret. Math..
[9] André Bouchet,et al. Greedy algorithm and symmetric matroids , 1987, Math. Program..
[10] Endre Boros,et al. Preprocessing of unconstrained quadratic binary optimization , 2006 .
[11] Gurmeet Singh,et al. MRF's forMRI's: Bayesian Reconstruction of MR Images via Graph Cuts , 2006, CVPR.
[12] Satoru Fujishige,et al. A characterization of bisubmodular functions , 1996, Discret. Math..
[13] S. Thomas McCormick,et al. Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization , 2008, SODA '08.
[14] Endre Boros,et al. Pseudo-Boolean optimization , 2002, Discret. Appl. Math..
[15] Michel Balinski,et al. Integer Programming: Methods, Uses, Computations , 1965 .
[16] Hiroshi Ishikawa,et al. Higher-order clique reduction in binary graph cut , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.
[17] S. H. Lu,et al. Roof duality for polynomial 0–1 optimization , 1987, Math. Program..
[18] Vladimir Kolmogorov,et al. Submodularity on a Tree: Unifying $L^\natural$ -Convex and Bisubmodular Functions , 2010, MFCS.
[19] VekslerOlga,et al. Fast Approximate Energy Minimization via Graph Cuts , 2001 .
[20] Liqun Qi,et al. Directed submodularity, ditroids and directed submodular flows , 1988, Math. Program..
[21] Satoru Iwata,et al. Submodular Function Minimization under Covering Constraints , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[22] Vladimir Kolmogorov,et al. Minimizing a sum of submodular functions , 2010, Discret. Appl. Math..
[23] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..
[24] Michel Balinski,et al. Integer Programming: Methods, Uses, Computation , 2010, 50 Years of Integer Programming.
[25] Pierre Hansen,et al. Roof duality, complementation and persistency in quadratic 0–1 optimization , 1984, Math. Program..
[26] Michael J. Black,et al. Fields of Experts , 2009, International Journal of Computer Vision.
[27] Andrew Blake,et al. Fusion Moves for Markov Random Field Optimization , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[28] Andrew Blake,et al. LogCut - Efficient Graph Cut Optimization for Markov Random Fields , 2007, 2007 IEEE 11th International Conference on Computer Vision.
[29] 藤重 悟. Submodular functions and optimization , 1991 .
[30] Dorit S. Hochbaum,et al. Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations , 2002, Eur. J. Oper. Res..
[31] Dorit S. Hochbaum. Instant Recognition of Half Integrality and 2-Approximations , 1998, APPROX.
[32] William J. Cook,et al. Exact solutions to linear programming problems , 2007, Oper. Res. Lett..