Cache-efficient graph cuts on structured grids

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

Volumn , Issue , 2012, Pages 3673-3680

  Jamriska, Ondrej ^a   Sykora, Daniel ^a   Hornung, Alexander ^b  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^b DISNEY RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE-EFFICIENT; COMPACT DATA STRUCTURE; COMPUTATION SPEED; EFFICIENT IMPLEMENTATION; GRACEFUL PERFORMANCE DEGRADATIONS; GRAPH CUT; GRID RESOLUTION; GRID-LIKE; HIERARCHICAL PROCESSING; HIGH-RESOLUTION GRIDS; MEMORY BANDWIDTHS; MEMORY CONSUMPTION; MEMORY LAYOUT; MINIMAL CUTS; N-D GRID; NEIGHBORHOOD SYSTEMS; PERFORMANCE GAIN; STRUCTURED GRID;

COMPUTER VISION; DATA STRUCTURES; TOPOLOGY;

CACHE MEMORY;

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

References (35)

1. A. Agarwala, M. Dontcheva, M. Agrawala, S. Drucker, A. Colburn, B. Curless, D. Salesin, and M. Cohen. Interactive digital photomontage. ACM Transactions on Graphics, 23(3):294-302, 2004. 1
2. C. Arora, S. Banerjee, P. Kalra, and S. N. Maheshwari. An efficient graph cut algorithm for computer vision problems. In Proceedings of European Conference on Computer Vision, pages 552-565, 2010. 5
3. D. A. Bader and V. Sachdeva. A cache-aware parallel implementation of the push-relabel network flow algorithm and experimental evaluation of the gap relabeling heuristic. In Proceedings of International Conference on Parallel and Distributed Computing Systems, pages 41-48, 2005. 2
4. Y. Boykov and M.-P. Jolly. Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images. In Proceedings of International Conference on Computer Vision, volume 1, pages 105-112, 2001. 1, 4
5. Y. Boykov and V. Kolmogorov. Computing geodesics and minimal surfaces via graph cuts. In Proceedings of International Conference on Computer Vision, pages 26-33, 2003. 1
6. 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, 2004. 1, 2, 3
7. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11):1222-1239, 2001. 1, 4
8. B. G. Chandran and D. S. Hochbaum. A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem. Operations Research, 57(2):358-376, 2009. 1
9. T. M. Chilimbi, M. D. Hill, and J. R. Larus. Making pointerbased data structures cache conscious. IEEE Computer, 33(12):67-74, 2000. 3
10. A. Delong and Y. Boykov. A scalable graph-cut algorithm for N-D grids. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2008. 2, 3
11. B. Fishbain, D. S. Hochbaum, and S. Mueller. Competitive analysis of minimum-cut maximum flow algorithms in vision problems. The Computing Research Repository, 2010. 1
12. L. R. Ford and D. R. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8:399-404, 1956. 1
13. B. Glocker, N. Komodakis, G. Tziritas, N. Navab, and N. Paragios. Dense image registration through MRFs and efficient linear programming. Medical Image Analysis, 12(6):731-741, 2008. 1
14. A. Goldberg. Two-level push-relabel algorithm for the maximum flow problem. In Proceedings of International Conference on Algorithmic Aspects in Information and Management, pages 212-225, 2009. 1
15. A. Goldberg and R. E. Tarjan. A new approach to the maximum flow problem. Journal of the ACM, 35:921-940, 1988. 1, 2
16. A. V. Goldberg, S. Hed, H. Kaplan, R. E. Tarjan, and R. F. F. Werneck. Maximum flows by incremental breadthfirst search. In Proceedings of Annual European Symposium on Algorithms, pages 457-468, 2011. 1, 2, 5
17. A. Hornung and L. Kobbelt. Robust reconstruction of watertight 3d models from non-uniformly sampled point clouds without normal information. In Symposium on Geometry Processing, pages 41-50, 2006. 1
18. O. Juan and Y. Y. Boykov. Active graph cuts. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pages I: 1023-1029, 2006. 2
19. O. Juan and Y. Y. Boykov. Capacity scaling for graph cuts in vision. In Proceedings of IEEE International Conference on Computer Vision, 2007. 2
20. P. Kohli and P. H. S. Torr. Dynamic graph cuts and their applications in computer vision. In Computer Vision: Detection, Recognition and Reconstruction, pages 51-108. Springer, 2010. 1, 2
21. V. Kolmogorov. Graph Based Algorithms for Scene Reconstruction from Two or More Views. PhD thesis, Cornell University, 2003. 3, 4
22. V. Lempitsky and Y. Boykov. Global optimization for shape fitting. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2007. 1
23. V. Lempitsky and D. Ivanov. Seamless mosaicing of imagebased texture maps. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2007. 1
24. Y. Li, J. Sun, and H.-Y. Shum. Video object cut and paste. ACM Transactions on Graphics, 24(3):595-600, 2005. 1
25. J. Liu and J. Sun. Parallel graph-cuts by adaptive bottom-up merging. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pages 2181-2188, 2010. 1, 2, 3
26. J. Liu, J. Sun, and H.-Y. Shum. Paint selection. ACM Transactions on Graphics, 28(3):69, 2009. 2
27. H. Lombaert, Y. Y. Sun, L. Grady, and C. Y. Xu. A multilevel banded graph cuts method for fast image segmentation. In Proceedings of IEEE International Conference on Computer Vision, pages I: 259-265, 2005. 2
28. C. Rother, V. Kolmogorov, and A. Blake. Grabcut - Interactive foreground extraction using iterated graph cuts. ACM Transactions on Graphics, 23(3):309-314, 2004. 1
29. M. Rubinstein, A. Shamir, and S. Avidan. Improved seam carving for video retargeting. ACM Transactions on Graphics, 27(3):16, 2008. 1
30. A. Shekhovtsov and V. Hlavac. A distributed mincut/ maxflow algorithm combining path augmentation and push-relabel. In Proceedings of the International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, page 14, 2011. 2
31. P. Strandmark and F. Kahl. Parallel and distributed graph cuts by dual decomposition. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pages 2085-2092, 2010. 2
32. D. Sýkora, J. Dingliana, and S. Collins. LazyBrush: Flexible painting tool for hand-drawn cartoons. Computer Graphics Forum, 28(2):599-608, 2009. 1, 4
33. R. S. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother. A comparative study of energy minimization methods for markov random fields with smoothness-based priors. IEEE Transactions Pattern Analysis and Machine Intelligence, 30(6):1068-1080, 2008. 4
34. V. Vineet and P. J. Narayanan. CUDA cuts: Fast graph cuts on the GPU. In Proceedings of Workshop on Visual Computer Vision on GPUs, 2008. 2, 3
35. G. Vogiatzis, P. H. S. Torr, and R. Cipolla. Multi-view stereo via volumetric graph-cuts. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pages 391-398, 2005. 1