Uncertainty Driven Multi-scale Energy Minimization
暂无分享,去创建一个
[1] Pushmeet Kohli,et al. Measuring Uncertainty in Graph Cut Solutions - Efficiently Computing Min-marginal Energies Using Dynamic Graph Cuts , 2006, ECCV.
[2] Nikos Komodakis,et al. Fast, Approximately Optimal Solutions for Single and Dynamic MRFs , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.
[3] 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).
[4] Edward H. Adelson,et al. The Laplacian Pyramid as a Compact Image Code , 1983, IEEE Trans. Commun..
[5] Patrick Pérez,et al. Interactive Image Segmentation Using an Adaptive GMMRF Model , 2004, ECCV.
[6] Marie-Pierre Jolly,et al. Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images , 2001, ICCV.
[7] Thomas Hofmann,et al. Using Combinatorial Optimization within Max-Product Belief Propagation , 2007 .
[8] Marc Pollefeys,et al. Multi-View Stereo via Graph Cuts on the Dual of an Adaptive Tetrahedral Mesh , 2007, 2007 IEEE 11th International Conference on Computer Vision.
[9] D. Schlesinger,et al. TRANSFORMING AN ARBITRARY MINSUM PROBLEM INTO A BINARY ONE , 2006 .
[10] Leo Grady,et al. Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids , 2006, MICCAI.
[11] Patrick Pérez,et al. Restriction of a Markov random field on a graph and multiresolution statistical image modeling , 1996, IEEE Trans. Inf. Theory.
[12] Vladimir Kolmogorov,et al. Computing geodesics and minimal surfaces via graph cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[13] Marie-Pierre Jolly,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.
[14] Umar Mohammed,et al. Superpixel lattices , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[15] Leo Grady,et al. A multilevel banded graph cuts method for fast image segmentation , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.
[16] Hiroshi Ishikawa,et al. Exact Optimization for Markov Random Fields with Convex Priors , 2003, IEEE Trans. Pattern Anal. Mach. Intell..
[17] Endre Boros,et al. Pseudo-Boolean optimization , 2002, Discret. Appl. Math..
[18] Andrew Blake,et al. "GrabCut" , 2004, ACM Trans. Graph..
[19] Olga Veksler,et al. Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..
[20] Dani Lischinski,et al. Joint bilateral upsampling , 2007, SIGGRAPH 2007.
[21] Yuri Boykov,et al. A Scalable graph-cut algorithm for N-D grids , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[22] Victor S. Lempitsky,et al. Global Optimization for Shape Fitting , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.
[23] Michael F. Cohen,et al. Capturing and viewing gigapixel images , 2007, ACM Trans. Graph..
[24] Toby Sharp,et al. High resolution matting via interactive trimap segmentation , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[25] P. Kohli,et al. Efficiently solving dynamic Markov random fields using graph cuts , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.
[26] Nassir Navab,et al. Optical flow estimation with uncertainties through dynamic MRFs , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[27] Vladimir Kolmogorov,et al. Convergent Tree-Reweighted Message Passing for Energy Minimization , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[28] 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.
[29] D. Greig,et al. Exact Maximum A Posteriori Estimation for Binary Images , 1989 .