Mode-Marginals : Expressing Uncertainty via Diverse M-Best Solutions
暂无分享,去创建一个
[1] J. Munkres. ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .
[2] Yi Yang,et al. Articulated pose estimation with flexible mixtures-of-parts , 2011, CVPR 2011.
[3] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..
[4] Gregory Shakhnarovich,et al. Diverse M-Best Solutions in Markov Random Fields , 2012, ECCV.
[5] Pushmeet Kohli,et al. Measuring uncertainty in graph cut solutions , 2008, Comput. Vis. Image Underst..
[6] Ryan P. Adams,et al. Randomized Optimum Models for Structured Prediction , 2012, AISTATS.
[7] George Papandreou,et al. Perturb-and-MAP random fields: Using discrete optimization to learn and sample from energy models , 2011, 2011 International Conference on Computer Vision.
[8] Ryan P. Adams,et al. Revisiting uncertainty in graph cut solutions , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.
[9] Andrew Zisserman,et al. Upper Body Detection and Tracking in Extended Signing Sequences , 2011, International Journal of Computer Vision.
[10] Tommi S. Jaakkola,et al. On the Partition Function and Random Maximum A-Posteriori Perturbations , 2012, ICML.