Tight convex relaxations for vector-valued labeling

SIAM Journal on Imaging Sciences

Volumn 6, Issue 3, 2013, Pages 1626-1664

  Goldluecke, Bastian ^a   Strekalovskiy, Evgeny ^b   Cremers, Daniel ^b  

^a Heidelberg Collaboratory for Image Processing   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Algorithms; Convex relaxation; Duality; Multilabel problems

Indexed keywords

COMPUTATIONAL CHALLENGES; CONVEX RELAXATION; DUALITY; LOCAL NOISE ESTIMATIONS; MEMORY REQUIREMENTS; MULTI-LABEL PROBLEMS; OCCLUSION DETECTION; REDUCTION TECHNIQUES;

ALGORITHMS; RELAXATION PROCESSES;

PROBLEM SOLVING;

EID: 84884958964     PISSN: None     EISSN: 19364954     Source Type: Journal    
DOI: 10.1137/120862351     Document Type: Article

References (43)

1. G. Alberti, G. Bouchitté, and G. Dal Maso, The calibration method for the Mumford-Shah functional, C. R. Acad. Sci. Paris Sér. I Math., 329 (1999), pp. 249-254.
2. G. Alberti, G. Bouchitté, and G. Dal Maso, The calibration method for the Mumford-Shah functional and free-discontinuity problems, Calc. Var. Partial Differential Equations, 16 (2003), pp. 299-333.
3. H. Attouch, G. Buttazzo, and G. Michaille, Variational Analysis in Sobolev and BV Spaces: Applications to PDEs and Optimization, MOS-SIAM Ser. Optim. 6, SIAM, Philadelphia, 2006.
4. Y. Boykov and V. Kolmogorov, Computing geodesics and minimal surfaces via graph cuts, in Proceedings of the IEEE International Conference on Computer Vision (ICCV), 2003, pp. 26-33.
5. 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 (2004), pp. 1124-1137.
6. Y. Boykov, O. Veksler, and R. Zabih, Fast approximate energy minimization via graph cuts, IEEE Trans. Pattern Anal. Mach. Intell., 23 (2001), pp. 1222-1239.
7. T. Brox and D. Cremers, On local region models and a statistical interpretation of the piecewise smooth Mumford-Shah functional, Int. J. Comput. Vision, 84 (2009), pp. 184-193.
8. A. Chambolle, Finite-differences discretizations of the Mumford-Shah functional, M2AN Math. Model. Numer. Anal., 33 (1999), pp. 261-288.
9. A. Chambolle, D. Cremers, and T. Pock, A Convex Approach for Computing Minimal Partitions, Technical Report TR-2008-05, Department of Computer Science, University of Bonn, Bonn, Germany, 2008.
10. A. Chambolle and T. Pock, A first-order primal-dual algorithm for convex problems with applications to imaging, J. Math. Imaging Vision, 40 (2011), pp. 120-145.
11. T. F. Chan, S. Esedo-glu, and M. Nikolova, Algorithms for finding global minimizers of image segmentation and denoising models, SIAM J. Appl. Math., 66 (2006), pp. 1632-1648.
12. D. Cremers and K. Kolev, Multiview stereo and silhouette consistency via convex functionals over convex domains, IEEE Trans. Pattern Anal. Mach. Intell., 33 (2010), pp. 1161-1174.
13. A. Delong, A. Osokin, H. Isack, and Y. Boykov, Fast approximate energy minimization with label costs, Int. J. Comput. Vision, 96 (2012), pp. 1-27.
14. B. Glocker, N. Paragios, N. Komodakis, G. Tziritas, and N. Navab, Optical flow estimation with uncertainties through dynamic MRFs, in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition, 2008.
15. B. Goldluecke and D. Cremers, Convex relaxation for multilabel problems with product label spaces, in Proceedings of the 11th European Conference on Computer Vision (ECCV), Springer-Verlag, Berlin, Heidelberg, 2010, pp. 225-238.
16. D. Greig, B. Porteous, and A. Seheult, Exact maximum a posteriori estimation for binary images, J. R. Statist. Soc. B, 51 (1989), pp. 271-279.
17. H. Ishikawa, Exact optimization for Markov random fields with convex priors, IEEE Trans. Pattern Anal. Mach. Intell., 25 (2003), pp. 1333-1336.
18. M. Klodt, T. Schoenemann, K. Kolev, M. Schikora, and D. Cremers, An experimental comparison of discrete and continuous shape optimization methods, in Proceedings of the 10th European Conference on Computer Vision (ECCV), Springer-Verlag, Berlin, Heidelberg, 2008, pp. 332-345.
19. V. Kolmogorov, Convergent tree-reweighted message passing for energy minimization, IEEE Trans. Pattern Anal. Mach. Intell., 28 (2006), pp. 1568-1583.
20. V. Kolmogorov and C. Rother, Minimizing nonsubmodular functions with graph cuts-A review, IEEE Trans. Pattern Anal. Mach. Intell., 29 (2007), pp. 1274-1279.
21. V. Kolmogorov and R. Zabih, What energy functions can be minimized via graph cuts, IEEE Trans. Pattern Anal. Mach. Intell., 26 (2004), pp. 147-159.
22. J. Lellmann, F. Becker, and C. Schnörr, Convex optimization for multi-class image labeling with a novel family of total variation based regularizers, in Proceedings of the IEEE International Conference on Computer Vision (ICCV), 2009.
23. C. Michelot, A finite algorithm for finding the projection of a point onto the canonical simplex of Rn, J. Optim. Theory Appl., 50 (1986), pp. 195-200.
24. T. Pock and A. Chambolle, Diagonal preconditioning for first order primal-dual algorithms in convex optimization, in Proceedings of the 2011 IEEE International Conference on Computer Vision, 2011.
25. T. Pock, A. Chambolle, H. Bischof, and D. Cremers, A convex relaxation approach for computing minimal partitions, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2009, pp. 810-817.
26. T. Pock, D. Cremers, H. Bischof, and A. Chambolle, An algorithm for minimizing the piecewise smooth Mumford-Shah functional, in Proceedings of the 12th IEEE International Conference on Computer Vision, 2009.
27. T. Pock, D. Cremers, H. Bischof, and A. Chambolle, Global solutions of variational models with convex regularization, SIAM J. Imaging Sci., 3 (2010), pp. 1122-1145.
28. T. Pock, T. Schoenemann, G. Graber, H. Bischof, and D. Cremers, A convex formulation of continuous multi-label problems, in Proceedings of the 10th European Conference on Computer Vision (ECCV), Springer-Verlag, Berlin, Heidelberg, 2008, pp. 792-805.
29. S. Ramalingam, P. Kohli, K. Alahari, and P. Torr, Exact inference in multi-label CRFs with higher order cliques, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2008.
30. R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, 1996.
31. D. Schlesinger and B. Flach, Transforming an Arbitrary Min-Sum Problem into a Binary One, Technical report, Dresden University of Technology, Dresden, Germany, 2006.
32. A. Shekhovtsov, J. Garcia-Arteaga, and T. Werner, A discrete search method for multi-modal non-rigid image registration, in Proceedings of the 2008 IEEE CVPR Workshop on Non-Rigid Shape Analysis and Deformable Image Alignment, 2008.
33. A. Shekhovtsov, I. Kovtun, and V. Hlavac, Efficient MRF deformation model for non-rigid image matching, Computer Vis. Image Underst., 112 (2008), pp. 91-99.
34. G. Strang, Maximal flow through a domain, Math. Programming, 26 (1983), pp. 123-143.
35. E. Strekalovskiy and D. Cremers, Total variation for cyclic structures: Convex relaxation and efficient minimization, in Proceedings of the 2011 IEEE International Conference on Computer Vision and Pattern Recognition, 2011.
36. E. Strekalovskiy, B. Goldluecke, and D. Cremers, Tight convex relaxations for vector-valued labeling problems, in Proceedings of the 2011 IEEE International Conference on Computer Vision, IEEE Computer Society, Washington, DC, 2011, pp. 2328-2335.
37. R. Szeliski, Bayesian modeling of uncertainty in low-level vision, Int. J. Comput. Vision, 5 (1990), pp. 271-301.
38. R. 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, in Proceedings of the 9th European Conference on Computer Vision (ECCV), Springer-Verlag, Berlin, Heidelberg, 2006, pp. 16-29.
39. M. Tappen and W. Freeman, Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters, in Proceedings of the Ninth IEEE International Conference on Computer Vision, 2003.
40. M. Wainwright, T. Jaakkola, and A. Willsky, Map estimation via agreement on trees: Messagepassing and linear programming, IEEE Trans. Inform. Theory, 51 (2005), pp. 3697-3717.
41. C. Zach, D. Gallup, J. Frahm, and M. Niethammer, Fast global labeling for real-time stereo using multiple plane sweeps, in Vision, Modeling and Visualization 2008, Pro Universitate, Berlin, 2008, pp. 243-252.
42. C. Zach, C. Haene, and M. Pollefeys, What is optimized in tight convex relaxations for multi-label problems?, in Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition, 2012, pp. 1664-1671.
43. C. Zach, T. Pock, and H. Bischof, A duality based approach for realtime TV-L1 optical flow, in Proceedings of the 29th DAGM Conference on Pattern Recognition, Springer-Verlag, Berlin, Heidelberg, 2007, pp. 214-223.