A graph cut algorithm for higher-order Markov Random Fields
暂无分享,去创建一个
Endre Boros | Ramin Zabih | Alexander Fix | Aritanan Gruber | R. Zabih | E. Boros | Aritanan Gruber | Alexander Fix
[1] Endre Boros,et al. Pseudo-Boolean optimization , 2002, Discret. Appl. Math..
[2] Daniel Freedman,et al. Energy minimization via graph cuts: settling what is possible , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).
[3] S. Vajda,et al. BOOLEAN METHODS IN OPERATIONS RESEARCH AND RELATED AREAS , 1969 .
[4] Andrew Blake,et al. Fusion Moves for Markov Random Field Optimization , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[5] Michael J. Black,et al. Fields of Experts , 2009, International Journal of Computer Vision.
[6] Ullrich Köthe,et al. An Empirical Comparison of Inference Algorithms for Graphical Models with Higher Order Factors Using OpenGM , 2010, DAGM-Symposium.
[7] Richard Szeliski,et al. A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[8] Pushmeet Kohli,et al. P³ & Beyond: Move Making Algorithms for Solving Higher Order Functions , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[9] Andrew W. Fitzgibbon,et al. Global stereo reconstruction under second order smoothness priors , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[10] Hiroshi Ishikawa. Higher-order clique reduction in binary graph cut , 2009, CVPR.
[11] Hiroshi Ishikawa,et al. Transformation of General Binary MRF Minimization to the First-Order Case , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[12] Olga Veksler,et al. Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..
[13] P. L. Ivanescu. Some Network Flow Problems Solved with Pseudo-Boolean Programming , 1965 .
[14] Pierre Hansen,et al. Roof duality, complementation and persistency in quadratic 0–1 optimization , 1984, Math. Program..
[15] Pushmeet Kohli,et al. Minimizing sparse higher order energy functions of discrete variables , 2009, CVPR.
[16] Vladimir Kolmogorov,et al. Minimizing Nonsubmodular Functions with Graph Cuts-A Review , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[17] Nikos Komodakis,et al. Beyond pairwise energies: Efficient optimization for higher-order MRFs , 2009, CVPR.
[18] Michael J. Black,et al. Efficient Belief Propagation with Learned Higher-Order Markov Random Fields , 2006, ECCV.