Parallel and distributed vision algorithms using dual decomposition

Computer Vision and Image Understanding

Volumn 115, Issue 12, 2011, Pages 1721-1732

  Strandmark, Petter ^a   Kahl, Fredrik ^a   Schoenemann, Thomas ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

Dual decomposition; GPU; Graph cuts; MPI; MRF; Parallel

Indexed keywords

DUAL DECOMPOSITION; GPU; GRAPH CUT; MPI; MRF; PARALLEL;

CURVE FITTING; GRAPHIC METHODS; IMAGE SEGMENTATION; OPTIMIZATION; PERSONAL COMPUTERS; SUPERCOMPUTERS;

ALGORITHMS;

EID: 80455164637     PISSN: 10773142     EISSN: 1090235X     Source Type: Journal    
DOI: 10.1016/j.cviu.2011.06.012     Document Type: Article

References (44)

1. D.M. Greig, B.T. Porteous, and A.H. Seheult Exact maximum a posteriori estimation for binary images J. Roy. Stat. Soc. 51 2 1989 271 279
2. Y. Boykov, and V. Kolmogorov An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision IEEE Trans. Pattern Anal. Mach. Intell. 26 9 2004 1124 1137
3. Y. Boykov, O. Veksler, R. Zabih, Markov random fields with efficient approximations, in: Conf. Computer Vision and Pattern Recognition, 1998.
4. C. Rother, V. Kolmogorov, and A. Blake Grabcut - interactive foreground extraction using iterated graph cuts ACM Trans. Graphics 23 3 2004 309 314 10.1145/1015706.1015720 < http://doi.acm.org/ > (Pubitemid 40163720)
5. Lempitsky V, Boykov Y. Global optimization for shape fitting, in: Conf. Computer Vision and Pattern Recognition, Minneapolis, USA, 2007.
6. V. Kolmogorov, and R. Zabih What energy functions can be minimized via graph cuts? IEEE Trans. Pattern Anal. Mach. Intell. 26 2 2004 147 159
7. Y. Boykov, O. Veksler, and R. Zabih Fast approximate energy minimization via graph cuts IEEE Trans. Pattern Anal. Mach. Intell. 23 11 2001 1222 1239 10.1109/34.969114 (Pubitemid 33137959)
8. N. Komodakis, N. Paragios, and G. Tziritas MRF optimization via dual decomposition: message-passing revisited Int. Conf. Computer Vision 2007 IEEE
9. N. Komodakis, and G. Tziritas Approximate labeling via graph cuts based on linear programming IEEE Trans. Pattern Anal. Mach. Intell. 29 8 2007 1436 1453 (Pubitemid 47040441)
10. P. Carr, R. Hartley, Minimizing energy functions on 4-connected lattices using elimination, in: Int. Conf. Computer Vision, 2009.
11. D.P. Bertsekas Nonlinear Programming 1999 Athena Scientific
12. P. Kohli, P.H.S. Torr, Efficiently solving dynamic Markov random fields using graph cuts, in: Int. Conf. Computer Vision, 2005.
13. P. Strandmark, F. Kahl, Parallel and distributed graph cuts by dual decomposition, in: Conf. Computer Vision and Pattern Recognition, San Francisco, USA, 2010.
14. T. Schoenemann, F. Kahl, D. Cremers, Curvature regularity for region-based image segmentation and inpainting: a linear programming relaxation, in: Int. Conf. Computer Vision, 2009.
15. L.M. Goldschlager, R.A. Shaw, and J. Staples The maximum flow problem is log space complete for P Theor. Comput. Sci. 21 1 1982 105 111
16. J. Liu, J. Sun, and H.Y. Shum Paint selection ACM Trans. Graphics 28 3 2009 1 7 10.1145/1531326.1531375 http://doi.acm.org/
17. J. Liu, J. Sun, Parallel graph-cuts by adaptive bottom-up merging, in: Conf. Computer Vision and Pattern Recognition, San Francisco, USA, 2010.
18. A.V. Goldberg, and R.E. Tarjan A new approach to the maximum flow problem STOC '86: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing 1986 ACM New York, NY, USA 136 146 doi:10.1145/12130.12144, < http://doi.acm.org/ >, ISBN 0-89791-193-8
19. A. Delong, Y. Boykov, A scalable graph-cut algorithm for N-D grids, in: Conf. Computer Vision and Pattern Recognition, 2008, doi:10.1109/CVPR.2008. 4587464.
20. V. Vineet, P. Narayanan, CUDA cuts: fast graph cuts on the GPU, in: Computer Vision and Pattern Recognition Workshops, CVPRW, 2008, doi:10.1109/CVPRW.2008.4563095.
21. V. Vineet, P.J. Narayanan, Solving multi-label MRFs using incremental alpha-expansion move on the GPUs, in: Asian Conference on Computer Vision, 2009.
22. M. Hussein, A. Varshney, L. Davis, On implementing graph cuts on CUDA, in: Workshop on General Purpose Processing on Graphics Processing Units, 2007.
23. N. Dixit, R. Keriven, N. Paragios, GPU-cuts: combinatorial optimisation, graphic processing units and adaptive object extraction, Tech. Rep. 05-07, CERTIS, 2005.
24. 1 norm minimization IEEE Trans. Pattern Anal. Mach. Intell. 30 10 2008 1866 1871
25. M. Klodt, T. Schoenemann, K. Kolev, M. Schikora, D. Cremers, An experimental comparison of discrete and continuous shape optimization methods, in: European Conf. Computer Vision, 2008.
26. V. Lempitsky, C. Rother, S. Roth, and A. Blake Fusion moves for Markov random field optimization IEEE Trans. Pattern Anal. Mach. Intell. 32 8 2010 1392 1405
27. M. Unger, T. Pock, D. Cremers, H. Bischof, TVSeg-interactive total variation based image segmentation, in: British Machine Vision Conf., 2008.
28. M. Werlberger, W. Trobin, T. Pock, A. Wedel, D. Cremers, H. Bischof, Anisotropic Huber-L1 optical flow, in: British Machine Vision Conf., 2009.
29. H. Everett Generalized lagrange multiplier method for solving problems of optimum allocation of resources Oper. Res. 11 1963 399 417
30. A. Rantzer, Dynamic dual decomposition for distributed control, in: American Control Conference, 2009.
31. S. Boyd, and L. Vandenberghe Convex Optimization 2004 Cambridge University Press ISBN 0521833787
32. C.H. Papadimitriou, and K. Steiglitz Combinatorial Optimization; Algorithms and Complexity 1998 Dover Publications
33. D. Martin, C. Fowlkes, D. Tal, J. Malik, A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics, in: Int. Conf. Computer Vision, 2001.
34. Y. Boykov, V. Kolmogorov, Computing geodesics and minimal surfaces via graph cuts, in: Int. Conf. Computer Vision, 2003.
35. V. Kolmogorov, Y. Boykov, What metrics can be approximated by geo-cuts, or global optimization of length/area and flux, in: Int. Conf. Computer Vision, 2005.
36. University of Western Ontario, Max-flow Problem Instances in Vision, 2010, < http://vision.csd.uwo.ca/maxflow-data >.
37. M. Snir, and S. Otto MPI - The Complete Reference: The MPI Core 1998 MIT Press Cambridge, MA, USA ISBN 0262692155
38. R.E. Bellman, and S.E. Dreyfus Applied Dynamic Programming 1962 Princeton University Press
39. K. Alahari, P. Kohli, and P.H.S. Torr Dynamic hybrid algorithms for map inference in discrete MRFs IEEE Trans. Pattern Anal. Mach. Intell. 32 2010 1846 1857
40. P. Carr, R. Hartley, Minimizing energy functions on 4-connected lattices using elimination, in: Int. Conf. Computer Vision, 2009.
41. A.A. Amini, T.E. Weymouth, and R.C. Jain Using dynamic programming for solving variational problems in vision IEEE Trans. Pattern Anal. Mach. Intell. 12 9 1990 855 867
42. P. Parent, and S.W. Zucker Trace inference, curvature consistency, and curve detection IEEE Trans. Pattern Anal. Mach. Intell. 11 8 1989 823 839
43. A.M. Bruckstein, A.N. Netravali, and T.J. Richardson Epi-convergence of discrete elastica Appl. Anal. 79 2001 137 171 (Bob Caroll Special Issue)
44. R. Lougee-Heimer The common optimization interface for operations research: promoting open-source software in the operations research community IBM J. Res. Dev. 47 1 2003 57 66