A global perspective on MAP inference for low-level vision
暂无分享,去创建一个
[1] Song-Chun Zhu,et al. Filters, Random Fields and Maximum Entropy (FRAME): Towards a Unified Theory for Texture Modeling , 1998, International Journal of Computer Vision.
[2] Daniel Cremers,et al. Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts , 2006, ECCV.
[3] J. WainwrightM.,et al. MAP estimation via agreement on trees , 2005 .
[4] Andrew Blake,et al. "GrabCut" , 2004, ACM Trans. Graph..
[5] Tao Zhang,et al. Active contours for tracking distributions , 2004, IEEE Transactions on Image Processing.
[6] Rahul Gupta,et al. Efficient inference with cardinality-based clique potentials , 2007, ICML '07.
[7] Harry Shum,et al. Image segmentation by data driven Markov chain Monte Carlo , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.
[8] Andrew Blake,et al. Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).
[9] Martin J. Wainwright,et al. MAP estimation via agreement on trees: message-passing and linear programming , 2005, IEEE Transactions on Information Theory.
[10] Luc Van Gool,et al. A Compact Model for Viewpoint Dependent Texture Synthesis , 2000, SMILE.
[11] Michael I. Jordan,et al. Shared Segmentation of Natural Scenes Using Dependent Pitman-Yor Processes , 2008, NIPS.
[12] Vladimir Kolmogorov,et al. Convergent Tree-Reweighted Message Passing for Energy Minimization , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[13] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .
[14] Pushmeet Kohli,et al. Robust Higher Order Potentials for Enforcing Label Consistency , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[15] Song-Chun Zhu,et al. FRAME: filters, random fields, and minimax entropy towards a unified theory for texture modeling , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[16] Irfan A. Essa,et al. Graphcut textures: image and video synthesis using graph cuts , 2003, ACM Trans. Graph..
[17] Songde Ma,et al. Sequential synthesis of natural textures , 1985, Comput. Vis. Graph. Image Process..
[18] Vladimir Kolmogorov,et al. Joint optimization of segmentation and appearance models , 2009, 2009 IEEE 12th International Conference on Computer Vision.
[19] Tomás Werner,et al. High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF) , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[20] C. Fox,et al. Exact MAP states and expectations from perfect sampling: Greig, porteous and seheult revisited , 2001 .
[21] Nikos Komodakis,et al. MRF Optimization via Dual Decomposition: Message-Passing Revisited , 2007, 2007 IEEE 11th International Conference on Computer Vision.
[22] Dani Lischinski,et al. Solid texture synthesis from 2D exemplars , 2007, SIGGRAPH 2007.
[23] Vladimir Kolmogorov,et al. Minimizing Nonsubmodular Functions with Graph Cuts-A Review , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[24] Robert E. Tarjan,et al. Improved Algorithms for Bipartite Network Flow , 1994, SIAM J. Comput..
[25] Greg Turk,et al. Graphcut textures: image and video texture synthesis using graph cuts , 2003, SIGGRAPH 2003.
[26] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[27] Dani Lischinski,et al. Solid texture synthesis from 2D exemplars , 2007, ACM Trans. Graph..
[28] Vladimir Kolmogorov,et al. Applications of parametric maxflow in computer vision , 2007, 2007 IEEE 11th International Conference on Computer Vision.