Active graph cuts

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn 1, Issue , 2006, Pages 1023-1029

  Juan, Olivier ^a   Boykov, Yuri ^b  

^a UNIVERSITÉ PARIS EST   (France)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GLOBAL MINIMA; INTERMEDIATE CUTS; STATE-OF-THE-ART MAX FLOW METHODS; VOLUMETRIC DATA;

ALGORITHMS; COMPUTER VISION; HIERARCHICAL SYSTEMS; ITERATIVE METHODS; LEARNING SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

COMPUTER GRAPHICS;

EID: 33845581508     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2006.47     Document Type: Conference Paper

References (15)

1. Y.Boykov and G.Funka-Lea. Graph cuts and efficient N-D image segmentation. In IJCV, 2006 (to appear).
2. Earlier in Y. Boykov and M.-P Jolly. Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images. In ICCV, vol. I, pp.105-112, July 2001.
3. Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. on Pattern Analysis and Machine Intelligence (PAMI), 26(9): 1124-1137, September 2004.
4. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE Trans. on PAMI, 23(11):1222-1239, November 2001.
5. E. A. Dinic. Algorithm for solution of a problem of max. flow in networks with power estimation. Soviet Math. Dokl., 11:1277-1280, 1970.
6. L. Ford and D. Fulkerson. Flows in Networks. Princeton University Press, 1962.
7. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. Journal of the Association for Computing Machinery, 35(4):921-940, October 1988.
8. D. S. Hochbaum. The pseudoflow algorithm for the maximum flow problem. Manuscript, UC Berkeley, revised 2003,
9. Extended abstract in: The pseudoflow algorithm and the pseudoflow-based simplex for the maximum flow problem. Proceedings of IPCO98, June 1998. Lecture Notes in Computer Science, 1412, Springer, 325-337.
10. A. V. Karzanov. Determinimg the max-flow in a network by the method of preflows. Soviet Math. Dokl., 15:434-437, 1974.
11. P. Kohli and P. H. Torr. Efficiently solving dynamic markov random fields using graph cuts. In ICCV, October 2005.
12. H. Lombaert, Y. Sun, L. Grady, and C. Xu. A multilevel banded graph cuts method for fast image segmentation. In ICCV, October 2005.
13. C. Rother, V. Kolmogorov, and A. Blake. Grabcut - interactive foreground extraction using iterated graph cuts. In ACM Transactions on Graphics (SIGGRAPH), August 2004.
14. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. J. of Comp. and System Sciences, 26(3):362-391, 1983.
15. N. Xu, R. Bansal, and N. Ahuja. Object segmentation using graph cuts based active contours. In CVPR 2003.