Graph cut based image segmentation with connectivity priors

26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR

Volumn , Issue , 2008, Pages

  Vicente, Sara ^a   Kolmogorov, Vladimir ^a   Rother, Carsten ^b  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ELONGATED OBJECTS; GLOBAL MINIMUM; GRAPH CUTS; HEURISTIC TECHNIQUES; INTERACTIVE IMAGE SEGMENTATION; LOWER BOUNDS; NP-HARD; OPTIMIZ ATION PROBLEMS; OPTIMIZATION ALGORITHMS; PROBLEM DECOMPOSITION;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL GEOMETRY; COMPUTER VISION; CONSTRAINED OPTIMIZATION; CONTROL THEORY; DIGITAL IMAGE STORAGE; FEATURE EXTRACTION; GRAPH THEORY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; IMAGE PROCESSING; NUCLEAR PROPULSION; OPTIMIZATION; PATTERN RECOGNITION;

IMAGE SEGMENTATION;

EID: 51949090071     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2008.4587440     Document Type: Conference Paper

References (29)

1. R. Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
2. D. Bertsekas. Nonlinear Programming. Athena Scientific, 1999.
3. Y. Boykov and M.-P. Jolly. Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images. In ICCV, 2001.
4. Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. PAMI, 26(9), Sept. 2004.
5. T. Deschamps and L. D. Cohen. Fast extraction of minimal paths in 3D images and applications to virtual endoscopy. Medical Image Analysis, 5(4):281-299, 2001.
6. L. Grady. Random walks for image segmentation. PAMI, 28(11):1768-1783, Nov. 2006.
7. D. Greig, B. Porteous, and A. Seheult. Exact maximum a posteriori estimation for binary images. J. of the Royal Statistical Society, Series B, 51(2):271-279, 1989.
8. P. L. Hammer, P. Hansen, and B. Simeone. Roof duality, complementation and persistency in quadratic 0-1 optimization. Mathematicl Programming, 28:121-155, 1984.
9. X. Han, C. Xu, and J. L. Prince. A topology preserving level set method for geometric deformable models. PAMI, 25(6):755-768, 2003.
10. I. Jermyn and H. Ishikawa. Globally optimal regions and boundaries as minimum ratio weight cycles. PAMI, 23(10), Oct. 2001.
11. M. Kass, A. Witkin, and D. Terzopoulos. Snakes: Active contour models. IJCV, 1(4):321-331, 1987.
12. R. Kimmel and A. M. Bruckstein. On regularized Laplacian zero crossings and other optimal edge integrators. IJCV, 53(3):225-243, 2003.
13. P. Kohli and P. H. S. Torr. Efficiently solving dynamic Markov random fields using graph cuts. In ICCV, 2005.
14. V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. PAMI, 28(10), 2006.
15. V. Kolmogorov and Y. Boykov. What metrics can be approximated by geo-cuts, or global optimization of length/area and flux. In ICCV, 2005.
16. V. Kolmogorov, Y. Boykov, and C. Rother. Applications of parametric maxflow in computer vision. In ICCV, 2007.
17. N. Komodakis, N. Paragios, and G. Tziritas. MRF optimization via dual decomposition: Message-passing revisited. In ICCV, 2005.
18. C. Rother, V. Kolmogorov, and A. Blake. Grabcut - interactive foreground extraction using iterated graph cuts. SIGGRAPH, August 2004.
19. M. I. Schlesinger and V. V. Giginyak. Solution to structural recognition (MAX,+)-problems by their equivalent transformations. Part 1. Control Systems and Computers, (1):3-15, 2007.
20. M. I. Schlesinger and V. V. Giginyak. Solution to structural recognition (MAX,+)-problems by their equivalent transformations. Part 2. Control Systems and Computers, (2):3-18, 2007.
21. T. Schoenemann and D. Cremers. Introducing curvature into globally optimimal image segmentation: Minimum ratio cycles on product graphs. In ICCV, Oct. 2007.
22. J. Shi and J. Malik. Normalized cuts and image segmentation. PAMI, 22(8):888-905, Aug. 2000.
23. N. Z. Shor. Minimization methods for nondifferentiable functions. Springer-Verlag, 1985.
24. A. K. Sinop and L. Grady. A seeded image segmentation framework unifying graph cuts and random walker which yields a new algorithm. In ICCV, Oct. 2007.
25. A. Vasilevskiy and K. Siddiqi. Flux maximizing geometric flows. PAMI, 24(12), 2002.
26. S. Vicente, V. Kolmogorov, and C. Rother. Graph cut based image segmentation with connectivity priors. Technical report, UCL, 2008.
27. M. Wainwright, T. Jaakkola, and A. Willsky. MAP estimation via agreement on trees: Message-passing and linear-programming approaches. IEEE Trans. Information Theory, 51(11):3697-3717, 2005.
28. T. Werner. A linear programming approach to max-sum problem: A review. PAMI, 29(7), 2007.
29. Y. Zeng, D. Samaras, W. Chen, and Q. Peng. Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images. Technical report, 2007.