Iterative narrowband-based graph cuts optimization for geodesic active contours with region forces (GACWRF)

IEEE Transactions on Image Processing

Volumn 21, Issue 1, 2012, Pages 284-296

  Tao, Wenbing ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Geodesic active contours (GAC); graph cuts; iterative algorithm; narrowband; region forces

Indexed keywords

GEODESIC ACTIVE CONTOUR; GRAPH CUT; ITERATIVE ALGORITHM; NARROW BANDS; REGION FORCES;

ALGORITHMS; GEODESY; GRAPHIC METHODS; OPTIMIZATION;

IMAGE SEGMENTATION;

ALGORITHM; ARTICLE; AUTOMATED PATTERN RECOGNITION; COMPUTER ASSISTED DIAGNOSIS; IMAGE ENHANCEMENT; METHODOLOGY; REPRODUCIBILITY; SENSITIVITY AND SPECIFICITY;

ALGORITHMS; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; PATTERN RECOGNITION, AUTOMATED; REPRODUCIBILITY OF RESULTS; SENSITIVITY AND SPECIFICITY;

EID: 84255177540     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIP.2011.2160955     Document Type: Article

References (40)

1. M. Kass, A. Witkin, and D. Terzopoulos, "Snakes: Active contour models," Int. J. Comput. Vis., vol. 1, no. 4, pp. 321-331, 1987.
2. V. Caselles, R. Kimmel, and G. Sapiro, "Geodesic active contours," Int. J. Comput. Vis., vol. 22, no. 1, pp. 61-79, Feb./Mar. 1997. (Pubitemid 127507390)
3. R. Goldenberg, R. Kimmel, E. Rivlin, and M. Rudzsky, "Fast geodesic active contours," IEEE Trans. Image Process., vol. 10, no. 10, pp. 1467-1475, Oct. 2001. (Pubitemid 32981821)
4. C. Xu and J. L. Prince, "Snakes, shapes, and gradient vector flow," IEEE Trans. Image Process., vol. 7, no. 3, pp. 359-369, Mar. 1998. (Pubitemid 128745354)
5. N. Sochen, R. Kimmel, and R. Malladi, "A general framework for low level vision," IEEE Trans. Image Process., vol. 7, no. 3, pp. 310-318, Mar. 1998. (Pubitemid 128745349)
6. L. D. Cohen and I. Cohen, "Finite-element methods for active contour models and balloons for 2-D and 3-D images," IEEE Trans. Pattern Anal. Mach. Intell., vol. 15, no. 11, pp. 1131-1147, Nov. 1993.
7. L. D. Cohen and R. Kimmel, "Global minimum for active contour models: A minimal path approach," Int. J. Comput. Vis., vol. 24, no. 1, pp. 57-78, 1997. (Pubitemid 127716437)
8. J. Sethian, "A fast marching level set method for monotonically advancing fronts," Proc. Nat. Acad. Sci. U. S. A., vol. 93, no. 4, pp. 1591-1595, Feb. 1996. (Pubitemid 26075170)
9. L. D. Cohen, "Multiple contour finding and perceptual grouping using minimal paths," J. Math. Imag. Vis., vol. 14, no. 3, pp. 225-236, May 2001. (Pubitemid 32638800)
10. B. Appleton and H. Talbot, "Globally optimal geodesic active contours," J. Math. Imaging Vis., vol. 23, no. 1, pp. 67-86, Jul. 2005. (Pubitemid 40539374)
11. X. Bresson, S. Esedoglu, P. Vandergheynst, J.-P. Thiram, and S. Osher, "Fast global minimization of the active contour/snake model," J. Math. Imaging Vis., vol. 28, no. 2, pp. 151-167, Jun. 2007. (Pubitemid 47312505)
12. L. I. Rudin, S. Osher, and E. Fatemi, "Nonlinear total variation based noise removal algorithms," Phys.D, vol. 60, no. 1-4, pp. 259-268, Nov. 1992.
13. D. Mumford and J. Shah, "Optimal approximations by piecewise smooth functions and associated variational problems," Commun. Pure Appl. Math., vol. 42, no. 5, pp. 577-685, Jul. 1989.
14. D. Mumford and J. Shah, "Boundary detection by minimizing functionals," in Proc. IEEE Comput. Soc. Conf. Comput. Vis. Pattern Recognit., 1985, pp. 22-26.
15. D. Greig, M. B. T. Porteous, and A. H. Seheult, "Exact maximum a posteriori estimation for binary images," J. Roy. Stat. Soc. B, vol. 51, no. 2, pp. 271-279, 1989.
16. Y. Boykov, O. Veksle, and R. Zabih, "Fast approximate energy minimization via graph cuts," IEEE Trans. Pattern Anal. Mach. Intell., vol. 23, no. 11, pp. 1222-1239, Nov. 2001. (Pubitemid 33137959)
17. Y. Boykov and V. Kolmogorov, "An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision," IEEE Trans. Pattern Anal. Mach. Intell., vol. 26, no. 9, pp. 1124-1137, Sep. 2004.
18. Y. Boykov, V. Kolmogorov, D. Cremersm, and A. Delong, "An integral solution to surface evolution PDEs via Geo-Cuts," in Proc. ECCV, 2006, pp. 409-422. (Pubitemid 44029694)
19. Y. Boykov and G. Funka-Lea, "Graph cuts and efficient N-D image segmentation," Int. J. Comput. Vis., vol. 70, no. 2, pp. 109-131, Nov. 2006. (Pubitemid 44127252)
20. Y. Li, J. Sun, C. K. Tang, and H. Y. Shum, "Lazy snapping," in Proc. SIGGRAPH Conf., 2004, pp. 303-308.
21. C. Rother, V. Kolmogorov, and A. Blake, "GrabCut: Interactive foreground extraction using iterated graph cuts," ACM Trans. Graph., vol. 23, pp. 309-314, 2004.
22. Y. Boykov and V. Kolmogorov, "Computing geodesics and minimal surfaces via graph cuts," in Proc. ICCV, 2003, pp. 26-33.
23. A. Chambolle, "Total variation minimization and a class of binary mrf models," in Energy Minimization Methods in Computer Vision and Pattern Recognition. Berlin, Germany: Springer-Verlag, 2005, pp. 136-152. (Pubitemid 43722931)
24. J. Darbon and M. Sigelle, "Image restoration with discrete constrained total variation Part I: Fast and exact optimization," J. Math. Imaging Vis., vol. 26, no. 3, pp. 261-276, Dec. 2006. (Pubitemid 44916361)
25. D. Kirsanov and S. Gortler, A discrete global minimization algorithm for continuous variational problems Harvard CS, Cambridge, MA, Tech. Rep. TR-14-04, 2004.
26. D. Fulkerson and L. Ford, Flows in Networks. Princeton, NJ: Princeton Univ. Press, 1962.
27. E. A. Dinic, "Algorithm for solution of a problem of maximum flow in networks with power estimation," Soviet Math. Dokl., vol. 11, pp. 1277-1280, 1970.
28. A. V. Goldberg and R. E. Tarjan, "A new approach to the maximum flow problem," in Proc. 18th Annu. ACMSymp. Theory Comput., 1986, pp. 136-146.
29. Z. Y. Wu and R. Leahy, "An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 15, no. 11, pp. 1101-1113, Nov. 1993.
30. J. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 22, no. 8, pp. 888-905, Aug. 2000.
31. N. Xu, N. Ahuja, and R. Bansal, "Object segmentation using graph cuts based active contours," in Proc. CVPR, 2003, pp. II-46-II-53.
32. S. Osher and R. Fedkiw, Level Set Methods and Dynamic Implicit Surfaces. New York: Cambridge Univ. Press, 2003.
33. S. Osher and R. Tsai, "Level set methods and their applications in image science," Commun. Math. Sci., vol. 1, no. 4, pp. 1-20, 2003.
34. S. Han, W. Tao, D. Wang, X.-C. Tai, and X. Wu, "Image segmentation based on GrabCut frame integrating multi-scale nonlinear structure tensor," IEEE Trans. Image Process., vol. 18, no. 10, pp. 2289-2302, Oct. 2009.
35. V. Kolmogorov and R. Zabih, "What energy functions can be minimized via graph cuts?," IEEE Trans. Pattern Anal. Mach. Intell., vol. 26, no. 2, pp. 147-159, Feb. 2004.
36. T. Chan and L. Vese, "Active contours without edges," IEEE Trans. Image Process., vol. 10, no. 2, pp. 266-277, Feb. 2001. (Pubitemid 32254596)
37. S. Geman and D. Geman, "Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images," IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-6, no. 6, pp. 721-741, Nov. 1984. (Pubitemid 15453722)
38. V. Kolmogorov and Y. Boykov, "What metrics can be approximated by geo-cuts, or global optimization of length/area and flux," in Proc. ICCV, 2005, pp. 564-571. (Pubitemid 44055006)
39. N. El-Zehiry, P. Sahoo, S. Xu, and A. Almaghraby, "Graph cut optimization for the Mumford Shah model," in Proc. 7th IASTED Int. Conf. VIIP, 2007, pp. 182-187.
40. S. Kichenassamy, A. Kumar, P. Olver, A. Tannenbaum, and A. Yezzi, "Gradient flows and geometric active contour models," in Proc. ICCV, 1995, pp. 810-815.