A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
暂无分享,去创建一个
Richard Szeliski | Vladimir Kolmogorov | Carsten Rother | Olga Veksler | Marshall F. Tappen | Ramin Zabih | Aseem Agarwala | Daniel Scharstein | D. Scharstein | R. Szeliski | R. Zabih | C. Rother | A. Agarwala | V. Kolmogorov | O. Veksler | M. Tappen | Daniel Scharstein
[1] P. L. Ivanescu. Some Network Flow Problems Solved with Pseudo-Boolean Programming , 1965 .
[2] Harold S. Stone,et al. Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.
[3] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[4] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[5] J. Besag. On the Statistical Analysis of Dirty Pictures , 1986 .
[6] Andrew Blake,et al. Visual Reconstruction , 1987, Deep Learning for EEG-Based Brain–Computer Interfaces.
[7] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[8] D. Greig,et al. Exact Maximum A Posteriori Estimation for Binary Images , 1989 .
[9] Stan Z. Li,et al. Markov Random Field Modeling in Computer Vision , 1995, Computer Science Workbench.
[10] Karel Driesen,et al. The direct cost of virtual function calls in C++ , 1996, OOPSLA '96.
[11] Brendan J. Frey,et al. A Revolution: Belief Propagation in Graphs with Cycles , 1997, NIPS.
[12] Carlo Tomasi,et al. A Pixel Dissimilarity Measure That Is Insensitive to Image Sampling , 1998, IEEE Trans. Pattern Anal. Mach. Intell..
[13] Olga Veksler,et al. Markov random fields with efficient approximations , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).
[14] Olga Veksler,et al. Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[15] W. Freeman,et al. Generalized Belief Propagation , 2000, NIPS.
[16] R. Zabih,et al. Exact voxel occupancy with graph cuts , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).
[17] Marie-Pierre Jolly,et al. Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images , 2001, ICCV.
[18] William T. Freeman,et al. Correctness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology , 1999, Neural Computation.
[19] William T. Freeman,et al. On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs , 2001, IEEE Trans. Inf. Theory.
[20] 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.
[21] D. Scharstein,et al. A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms , 2001, Proceedings IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV 2001).
[22] Alexei A. Efros,et al. Image quilting for texture synthesis and transfer , 2001, SIGGRAPH.
[23] Dorit S. Hochbaum,et al. An efficient algorithm for image segmentation, Markov random fields and related problems , 2001, JACM.
[24] Vladimir Kolmogorov,et al. Multi-camera Scene Reconstruction via Graph Cuts , 2002, ECCV.
[25] Abraham P. Punnen,et al. A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..
[26] Irfan A. Essa,et al. Graphcut textures: image and video synthesis using graph cuts , 2003, ACM Trans. Graph..
[27] William T. Freeman,et al. Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[28] Hiroshi Ishikawa,et al. Exact Optimization for Markov Random Fields with Convex Priors , 2003, IEEE Trans. Pattern Anal. Mach. Intell..
[29] Martin J. Wainwright,et al. Tree consistency and bounds on the performance of the max-product algorithm and its generalizations , 2004, Stat. Comput..
[30] Carlo Tomasi,et al. Surfaces with occlusions from layered stereo , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[31] Vladimir Kolmogorov,et al. What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[32] Harry Shum,et al. Lazy snapping , 2004, ACM Trans. Graph..
[33] Nando de Freitas,et al. From Fields to Trees , 2004, UAI.
[34] 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.
[35] David Salesin,et al. Interactive digital photomontage , 2004, ACM Trans. Graph..
[36] William T. Freeman,et al. Learning Low-Level Vision , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[37] Christopher M. Brown,et al. The theory and practice of Bayesian image labeling , 1990, International Journal of Computer Vision.
[38] Daniel P. Huttenlocher,et al. Efficient Belief Propagation for Early Vision , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..
[39] Stephen T. Barnard,et al. Stochastic stereo matching over scale , 1989, International Journal of Computer Vision.
[40] Andrew Blake,et al. "GrabCut" , 2004, ACM Trans. Graph..
[41] Andrew Blake,et al. Digital tapestry [automatic image synthesis] , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).
[42] Roberto Cipolla,et al. Multi-view stereo via volumetric graph-cuts , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).
[43] Pau Gargallo,et al. Bayesian 3D modeling from images using multiple depth maps , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).
[44] Andrew Blake,et al. Bi-layer segmentation of binocular stereo video , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).
[45] Adrian Barbu,et al. Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[46] Nikos Komodakis,et al. A new framework for approximate labeling via graph cuts , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.
[47] David Salesin,et al. Panoramic video textures , 2005, ACM Trans. Graph..
[48] William T. Freeman,et al. Constructing free-energy approximations and generalized belief propagation algorithms , 2005, IEEE Transactions on Information Theory.
[49] Martin J. Wainwright,et al. MAP estimation via agreement on trees: message-passing and linear programming , 2005, IEEE Transactions on Information Theory.
[50] Yair Weiss,et al. Globally optimal solutions for energy minimization in stereo vision using reweighted belief propagation , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.
[51] Martin J. Wainwright,et al. MAP estimation via agreement on (hyper)trees: Message-passing and linear programming , 2005, ArXiv.
[52] R. Szeliski. Locally adapted hierarchical basis preconditioning , 2006, SIGGRAPH '06.
[53] Andrew Blake,et al. Probabilistic Fusion of Stereo with Color and Contrast for Bilayer Segmentation , 2006, IEEE Trans. Pattern Anal. Mach. Intell..
[54] Vladimir Kolmogorov,et al. Comparison of Energy Minimization Algorithms for Highly Connected Graphs , 2006, ECCV.
[55] Vladimir Kolmogorov,et al. Convergent Tree-Reweighted Message Passing for Energy Minimization , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[56] Vladimir Kolmogorov,et al. Minimizing Nonsubmodular Functions with Graph Cuts-A Review , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[57] Pushmeet Kohli,et al. Dynamic Graph Cuts for Efficient Inference in Markov Random Fields , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[58] Olga Veksler. Graph Cut Based Optimization for MRFs with Truncated Convex Priors , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.
[59] Nikos Komodakis,et al. Fast, Approximately Optimal Solutions for Single and Dynamic MRFs , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.
[60] Nikos Komodakis,et al. Approximate Labeling via Graph Cuts Based on Linear Programming , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[61] Vladimir Kolmogorov,et al. Optimizing Binary MRFs via Extended Roof Duality , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.
[62] Stuart Geman,et al. Markov Random Field Image Models and Their Applications to Computer Vision , 2010 .