A multilevel banded graph cuts method for fast image segmentation

Proceedings of the IEEE International Conference on Computer Vision

Volumn I, Issue , 2005, Pages 259-265

  Lombaert, Herve ^a   Sun, Yiyong ^a   Grady, Leo ^a   Xu, Chenyang ^a  

^a SIEMENS CORPORATE RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER GRAPHICS; COMPUTER VISION; HEURISTIC METHODS; IMAGE ANALYSIS; NUMERICAL METHODS;

HIGH-RESOLUTION DATA; MULTILEVEL BANDED GRAPH CUTS; MULTILEVEL BANDED HEURISTIC; NARROW BAND;

IMAGE SEGMENTATION;

EID: 33745155997     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2005.13     Document Type: Conference Paper

References (12)

1. D. Adalsteinsson and J.A. Sethian. A fast level set method for propagating interfaces. Journal of Computational Physics, 118:269-277, 1995.
2. A. Barbu and S.-C. Zhu. Multigrid and multi-level Swendsen-Wang cuts for hierarchic graph partition. In IEEE International Conference on Computer Vision and Pattern Recognition, volume 2, pages 731-738, 2004.
3. Y. Boykov and M.P. Jolly. Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images. In International Conference on Computer Vision, volume 1, pages 105-112, July 2001.
4. Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(9):1124-1137, Sept. 2004.
5. B. Gidas. A renormalization group approach to image processing problems. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(2):164-180, Feb. 1989.
6. G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, 48:96-129, 1998.
7. T.Y. Kong and A. Rosenfeld. Digital topology: Introduction and survey. Computer Vision, Graphics, and Image Processing: Image Understanding, 48:357-393, 1989.
8. S. Krishnamachari and R. Chellappa. Multiresolution Gauss Markov random field models. IEEE Transactions on Image Processing, 6:251-267, February 1997.
9. Y. Li, J. Sun, C.K. Tang, and H.Y. Shum. Lazy snapping. In Proceedings of ACM SIGGRAPH 2004, volume 23, pages 303-308. ACM Press, April 2004.
10. P. Pérez and F. Heitz. Restriction of a Markov random field on a graph and multiresolution statistical image modeling. IEEE Transactions on Information Theory, 42(1):180-190, January 1996.
11. C. Rother, V. Kolmogorov, and A. Blake. "Grabcut": Interactive foreground extraction using iterated graph cuts. In Proceedings of ACM SIGGRAPH 2004, volume 23, pages 309-314. ACM Press, April 2004.
12. N. Xu, R. Bansal, and N. Ahuja. Object segmentation using graph cuts based active contours. In IEEE International Conference on Computer Vision and Pattern Recognition, volume 2, pages 46-53, 2003.