Iterative Narrowband-Based Graph Cuts Optimization for Geodesic Active Contours With Region Forces (GACWRF)
暂无分享,去创建一个
[1] Vladimir Kolmogorov,et al. Computing geodesics and minimal surfaces via graph cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[2] Stanley Osher,et al. REVIEW ARTICLE: Level Set Methods and Their Applications in Image Science , 2003 .
[3] Adel Said Elmaghraby,et al. Graph cut optimization for the Mumford-Shah model , 2007 .
[4] 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.
[5] J A Sethian,et al. A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.
[6] Daniel Cremers,et al. An Integral Solution to Surface Evolution PDEs Via Geo-cuts , 2006, ECCV.
[7] Andrew Blake,et al. "GrabCut" , 2004, ACM Trans. Graph..
[8] Roman Goldenberg,et al. Fast Geodesic Active Contours , 1999, Scale-Space.
[9] Richard M. Leahy,et al. An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation , 1993, IEEE Trans. Pattern Anal. Mach. Intell..
[10] Antonin Chambolle,et al. Total Variation Minimization and a Class of Binary MRF Models , 2005, EMMCVPR.
[11] Anthony J. Yezzi,et al. Gradient flows and geometric active contour models , 1995, Proceedings of IEEE International Conference on Computer Vision.
[12] Jérôme Darbon,et al. Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization , 2006, Journal of Mathematical Imaging and Vision.
[13] Gareth Funka-Lea,et al. Graph Cuts and Efficient N-D Image Segmentation , 2006, International Journal of Computer Vision.
[14] Ronald Fedkiw,et al. Level set methods and dynamic implicit surfaces , 2002, Applied mathematical sciences.
[15] Guillermo Sapiro,et al. Geodesic Active Contours , 1995, International Journal of Computer Vision.
[16] D. Mumford,et al. Optimal approximations by piecewise smooth functions and associated variational problems , 1989 .
[17] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[18] Ning Xu,et al. Object segmentation using graph cuts based active contours , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..
[19] S. Gortler,et al. A Discrete Global Minimization Algorithm for Continuous Variational Problems , 2004 .
[20] E. A. Dinic. Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .
[21] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[22] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[23] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[24] Jerry L. Prince,et al. Snakes, shapes, and gradient vector flow , 1998, IEEE Trans. Image Process..
[25] Ron Kimmel,et al. A general framework for low level vision , 1998, IEEE Trans. Image Process..
[26] Wenbing Tao,et al. Image Segmentation Based on GrabCut Framework Integrating Multiscale Nonlinear Structure Tensor , 2009, IEEE Transactions on Image Processing.
[27] L. Rudin,et al. Nonlinear total variation based noise removal algorithms , 1992 .
[28] Tony F. Chan,et al. Active contours without edges , 2001, IEEE Trans. Image Process..
[29] Olga Veksler,et al. Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[30] Eric V. Denardo,et al. Flows in Networks , 2011 .
[31] 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.
[32] Demetri Terzopoulos,et al. Snakes: Active contour models , 2004, International Journal of Computer Vision.
[33] D. Greig,et al. Exact Maximum A Posteriori Estimation for Binary Images , 1989 .
[34] Laurent D. Cohen. Multiple Contour Finding and Perceptual Grouping using Minimal Paths , 2004, Journal of Mathematical Imaging and Vision.
[35] Hugues Talbot,et al. Globally Optimal Geodesic Active Contours , 2005, Journal of Mathematical Imaging and Vision.
[36] Laurent D. Cohen,et al. Finite-Element Methods for Active Contour Models and Balloons for 2-D and 3-D Images , 1993, IEEE Trans. Pattern Anal. Mach. Intell..
[37] Laurent D. Cohen,et al. Global Minimum for Active Contour Models: A Minimal Path Approach , 1997, International Journal of Computer Vision.
[38] Vladimir Kolmogorov,et al. What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[39] Xavier Bresson,et al. Fast Global Minimization of the Active Contour/Snake Model , 2007, Journal of Mathematical Imaging and Vision.
[40] Harry Shum,et al. Lazy snapping , 2004, ACM Trans. Graph..