An Improved Riemannian Metric Approximation for Graph Cuts
暂无分享,去创建一个
[1] Vladimir Kolmogorov,et al. Computing geodesics and minimal surfaces via graph cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[2] Guillermo Sapiro,et al. Geodesic Active Contours , 1995, International Journal of Computer Vision.
[3] J. Sethian,et al. Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .
[4] Tony F. Chan,et al. Active contours without edges , 2001, IEEE Trans. Image Process..
[5] Kevin Q. Brown. Geometric transforms for fast geometric algorithms , 1979 .
[6] Hugues Talbot,et al. Globally minimal surfaces by continuous maximal flows , 2003, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[7] Nikos Paragios,et al. Handbook of Mathematical Models in Computer Vision , 2005 .
[8] Vladimir Kolmogorov,et al. What metrics can be approximated by geo-cuts, or global optimization of length/area and flux , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.
[9] Vladimir Kolmogorov,et al. An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision , 2004, IEEE Trans. Pattern Anal. Mach. Intell..
[10] Olga Veksler,et al. Graph Cuts in Vision and Graphics: Theories and Applications , 2006, Handbook of Mathematical Models in Computer Vision.
[11] 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).
[12] Pavel Matula,et al. Graph Cuts and Approximation of the Euclidean Metric on Anisotropic Grids , 2010, VISAPP.
[13] Gilbert Strang,et al. Maximum flows and minimum cuts in the plane , 2010, J. Glob. Optim..
[14] Gareth Funka-Lea,et al. Graph Cuts and Efficient N-D Image Segmentation , 2006, International Journal of Computer Vision.
[15] Marc Niethammer,et al. Continuous maximal flows and Wulff shapes: Application to MRFs , 2009, CVPR.