SlimCuts: GraphCuts for high resolution images using graph reduction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6819 LNCS, Issue , 2011, Pages 219-232

  Scheuermann, Björn ^a   Rosenhahn, Bodo ^a  

^a LEIBNIZ UNIVERSITY HANNOVER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH REDUCTION; GRAPH SIMPLIFICATION; HIGH RESOLUTION IMAGE; MAXIMUM FLOWS; MEMORY REDUCTION;

ALGORITHMS; COMPUTER VISION; PATTERN RECOGNITION SYSTEMS; PROBLEM SOLVING;

IMAGE SEGMENTATION;

EID: 80051766162     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23094-3_16     Document Type: Conference Paper

References (24)

1. Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. on Pattern Analysis and Machine Intelligence (TPAMI) 26(9), 1124-1137 (2004)
2. Blake, A., Rother, C., Brown, M., Perez, P., Torr, P.: Interactive image segmentation using an adaptive GMMRF model. In: Pajdla, T., Matas, J(G.) (eds.) ECCV 2004. LNCS, vol. 3021, pp. 428-441. Springer, Heidelberg (2004)
3. Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: Nineth IEEE Int. Conf. on Computer Vision (ICCV), pp. 26-33 (2003)
4. Lempitsky, V., Boykov, Y.: Global optimization for shape fitting. In: Comp. Vision and Pattern Recognition (CVPR), pp. 1-8 (2007)
5. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. on Pattern Analysis and Machine Intelligence (TPAMI) 23(11), 1222-1239 (2002)
6. Kohli, P., Torr, P.H.S.: Efficiently solving dynamic markov random fields using graph cuts. In: Tenth IEEE Int. Conf. on Computer Vision (ICCV), vol. 2, pp. 922-929 (2005) (Pubitemid 44042280)
7. Rother, C., Kolmogorov, V., Blake, A.: Grabcut: Interactive foreground extraction using iterated graph cuts. SIGGRAPH 23(3), 309-314 (2004)
8. Delong, A., Boykov, Y.: A scalable graph-cut algorithm for n-d grids. In: Comp. Vision and Pattern Recognition, CVPR (2008)
9. Boykov, Y., Jolly, M.P.: Interactive graph cuts for optimal boundary & region segmentation of objects in nd images. In: Eighth IEEE Int. Conf. on Computer Vision (ICCV), vol. 1, pp. 105-112 (2001) (Pubitemid 32794944)
10. Strandmark, P., Kahl, F.: Parallel and distributed graph cuts by dual decomposition. In: Comp. Vision and Pattern Recognition, CVPR (2010)
11. Vineet, V., Narayanan, P.: Cuda cuts: Fast graph cuts on the gpu. In: Comp. Vision and Pattern Recognition Workshops, CVPRW (2008)
12. Bhusnurmath, A., Taylor, C.J.: Graph cuts via l1 norm minimization. IEEE Trans. on Pattern Analysis and Machine Intelligence (TPAMI) 30(10), 1866-1871 (2008)
13. Klodt, M., Schoenemann, T., Kolev, K., Schikora, M., Cremers, D.: An experimental comparison of discrete and continuous shape optimization methods. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part I. LNCS, vol. 5302, pp. 332-345. Springer, Heidelberg (2008)
14. Puzicha, J., Buhmann, J.M.: Multiscale annealing for grouping and unsupervised texture segmentation. In: Comp. Vision and Image Understanding, vol. 76(3), pp. 213-230 (1999) (Pubitemid 30528061)
15. Lombaert, H., Sun, Y., Grady, L., Xu, C.: A multilevel banded graph cuts method for fast image segmentation. In: Tenth IEEE Int. Conf. on Computer Vision (ICCV), vol. 1, pp. 259-265 (2005) (Pubitemid 44054967)
16. Sinop, A.K., Grady, L.: Accurate banded graph cut segmentation of thin structures using laplacian pyramids. In: Larsen, R., Nielsen, M., Sporring, J. (eds.) MICCAI 2006. LNCS, vol. 4191, pp. 896-903. Springer, Heidelberg (2006) (Pubitemid 44609306)
17. Kohli, P., Lempitsky, V., Rother, C.: Uncertainty driven multi-scale optimization. In: Goesele, M., Roth, S., Kuijper, A., Schiele, B., Schindler, K. (eds.) Pattern Recognition. LNCS, vol. 6376, pp. 242-251. Springer, Heidelberg (2010)
18. Karger, D.R., Stein, C.: A new approach to the minimum cut problem. Journal of the ACM (JACM) 43(4), 601-640 (1996) (Pubitemid 126582607)
19. 2) time. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing. STOC 1996, pp. 47-55 (1996)
20. Spielman, D.A., Teng, S.H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing STOC 2004, pp. 81-90. ACM, New York (2004)
21. Chekuri, C.S., Goldberg, A.V., Karger, D.R., Levine, M.S., Stein, C.: Experimental study of minimum cut algorithms. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms SODA 1997, pp. 324-333. SIAM, Philadelphia (1997)
22. Padberg, M., Rinaldi, G.: An efficient algorithm for the minimum capacity cut problem. Mathematical Programming 47(1), 19-36 (1990)
23. Hogstedt, K., Kimelman, D., Rajan, V.T., Roth, T., Wegman, M.: Graph cutting algorithms for distributed applications partitioning. ACM SIGMETRICS Performance Evaluation Review 28(4), 27-29 (2001)
24. Ford, L., Fulkerson, D.: Maximum flow through a network. Canadian J. of Math. 8, 299-404 (1956)