Object segmentation using graph cuts based active contours

Computer Vision and Image Understanding

Volumn 107, Issue 3, 2007, Pages 210-224

  Xu, Ning ^a   Ahuja, Narendra ^b   Bansal, Ravi ^c  

^a SAMSUNG INFORMATION SYSTEMS AMERICA   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c Columbia University ^*  (United States)

Author keywords

Active contours; Graph cut; Object segmentation; Snakes

Indexed keywords

DATA STRUCTURES; EDGE DETECTION; GRAPH THEORY; ITERATIVE METHODS;

ACTIVE CONTOURS; GRAPH CUTS; ITERATIVE ALGORITHMS; OBJECT SEGMENTATION;

IMAGE SEGMENTATION;

EID: 34547487331     PISSN: 10773142     EISSN: 1090235X     Source Type: Journal    
DOI: 10.1016/j.cviu.2006.11.004     Document Type: Article

References (24)

1. Kass M., Witkin A., and Terzopoulos D. Snakes: active contour models. International Journal of Computer Vision 1 4 (1988) 321-331
2. Cohen L.D. On active contour models and balloons, computer vision, graphics. Image Processing: Image Understanding 53 2 (1991) 211-218
3. Xu C., and Prince J. Snakes, shapes, and gradient vector flow. IEEE Transaction on Image Processing 7 3 (1998) 359-369
4. V. Caselles, R. Kimmel, G. Sapiro, Geodesic active contours, in: Proceedings of IEEE International Conference on Computer Vision, 1995, pp. 694-699.
5. Osher S., and Sethian J. Fronts propagating with curvature dependent speed: algorithms based on Hamilton-Jacobi formulations. Journal of Computational Physics 79 (1988) 12-49
6. Malladi R., Sethian J.A., and Vemuri B.C. Shape modeling with front propagation: a level set approach. IEEE Transactions on Pattern Analysis and Machine Intelligence 17 2 (1995) 158-175
7. Sethian J. Level Set Methods and Fast Marching Methods (1999), Cambridge University Press, Cambridge, UK
8. Faugeras O., and Keriven R. Variational principles, surface evolution, PDE's, level set methods, and the stereo problem. IEEE Transactions on Image Processing 7 3 (1998) 336-344
9. N. Paragios, O. Mellina-Gottardo, and V. Ramesh, Gradient vector flow fast geodesic active contours, in: Proceedings of IEEE International Conference on Computer Vision, vol. 1, July 2001, pp. 67-73.
10. Amini A., Weymouth T., and Jain R. Using dynamic programming for solving variational problems in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence 12 9 (1990) 855-867
11. Geiger D., Gupta A., Costa L.A., and Vlontzos J. Dynamic programming for detecting, tracking, and matching deformable contours. IEEE Transactions on Pattern Analysis and Machine Intelligence 17 3 (1995) 294-302
12. Wu Z., and Leahy R. An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 15 11 (1993) 1101-1113
13. H. Ishikawa, D. Geiger, Segmentation by grouping junctions, in: Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition, June 1998, pp. 125-131.
14. Forsyth D., and Ponce J. Computer Vision: A Modern Approach. Upper Saddle River (2002), Prentice-Hall, New Jersey
15. V. Kolmogorov, R. Zabih, What energy functions can be minimized via graph cuts? in: Proceedings of European Conference on Computer Vision, 2002, pp. 65-81.
16. J. Shi, J. Malik, Normalized cuts and image segmentation, in: Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition, June 1997, pp. 731-737.
17. Wang S., and Siskind J. Image segmentation with ratio cut. IEEE Transactions on Pattern Analysis and Machine Intelligence 25 6 (2003) 675-690
18. Y. Boykov, M. Jolly, Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images, in: Proceedings of IEEE International Conference on Computer Vision, vol. 1, July 2001, pp. 105-112.
19. N. Xu, R. Bansal, N. Ahuja, Object segmentation using graph cuts based active contours, in: IEEE International Conference on Computer Vision and Pattern Recognition, June 2003, pp. 46-53.
20. Cormen T., Leiserson C., and Rivest R. Introduction to Algorithms (1990), McGraw-Hill Companies
21. Ford L., and Fulkerson D. Flows in Networks Princeton (1962), Princeton University Press, New Jersey
22. Ahuja R.K., Magnanti T., and Orlin J. Network Flows: Theory, Algorithms and Applications Upper Saddle River (1993), Prentice Hall, New Jersey
23. X. Han, C. Xu, J. Prince, A topology preserving deformable model using level sets, in: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, vol. 2, December 2001, pp. 765-770.
24. Y. Boykov, V. Kolmogorov, An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision, in: Proceedings of International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition, September 2001, pp. 359-374.