Convex relaxation for multilabel problems with product label spaces

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

Volumn 6315 LNCS, Issue PART 5, 2010, Pages 225-238

  Goldluecke, Bastian ^a   Cremers, Daniel ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; OPTICAL FLOWS; STEREO IMAGE PROCESSING;

CONVEX RELAXATION; HIGHER-DIMENSIONAL; LARGE-SCALE PROBLEM; MEMORY REQUIREMENTS; MULTI-LABEL PROBLEMS; OCCLUSION DETECTION; ORDERS OF MAGNITUDE; REDUCTION TECHNIQUES;

RELAXATION PROCESSES;

EID: 78149333144     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15555-0_17     Document Type: Conference Paper

References (21)

1. Lellmann, J., Becker, F., Schnörr, C.: Convex optimization for multi-class image labeling with a novel family of total variation based regularizers. In: IEEE International Conference on Computer Vision (ICCV) (2009)
2. Nikolova, M., Esedoglu, S., Chan, T.: Algorithms for finding global minimizers of image segmentation and denoising models. SIAM Journal of Applied Mathematics 66, 1632-1648 (2006) (Pubitemid 44599935)
3. Pock, T., Schoenemann, T., Graber, G., Bischof, H., Cremers, D.: A convex formulation of continuous multi-label problems. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part III. LNCS, vol. 5304, pp. 792-805. Springer, Heidelberg (2008)
4. Pock, T., Chambolle, A., Bischof, H., Cremers, D.: A convex relaxation approach for computing minimal partitions. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 810-817 (2009)
5. Zach, C., Gallup, D., Frahm, J., Niethammer, M.: Fast global labeling for real-time stereo using multiple plane sweeps. In: Vision, Modeling and Visualization, pp. 243-252 (2009)
6. Szeliski, R.: Bayesian modeling of uncertainty in low-level vision. International Journal of Computer Vision 5, 271-301 (1990)
7. Kindermann, R., Snell, J.: Markov Random Fields and Their Applications. American Mathematical Society, Providence (1980)
8. Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: IEEE International Conference on Computer Vision (ICCV), pp. 26-33 (2003)
9. Greig, D., Porteous, B., Seheult, A.: Exact maximum a posteriori estimation for binary images. J. Royal Statistics Soc. 51, 271-279 (1989)
10. Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell. 26, 147-159 (2004)
11. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell. 23, 1222-1239 (2001)
12. Schlesinger, D., Flach, B.: Transforming an arbitrary min-sum problem into a binary one. Technical report, Dresden University of Technology (2006)
13. Wainwright, M., Jaakkola, T., Willsky, A.: Map estimation via agreement on trees: message-passing and linear programming. IEEE Trans. Inf. Theory 51, 3697-3717 (2005)
14. Ishikawa, H.: Exact optimization for markov random fields with convex priors. IEEE Trans. Pattern Anal. Mach. Intell. 25, 1333-1336 (2003)
15. 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)
16. Popov, L.: A modification of the arrow-hurwicz method for search of saddle points. Math. Notes 28, 845-848 (1980)
17. Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Prog. 103, 127-152 (2004)
18. Beck, A., Teboulle, M.: Fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sciences 2, 183-202 (2009)
19. 1 optical flow. In: Hamprecht, F.A., Schnörr, C., Jähne, B. (eds.) DAGM2007. LNCS, vol. 4713, pp. 214-223. Springer, Heidelberg (2007)
20. Duval, V., Aujol, J.F., Vese, L.: Projected gradient based color image decomposition. In: Tai, X.-C., Mørken, K., Lysaker, M., Lie, K.-A. (eds.) Scale Space and Variational Methods in Computer Vision. LNCS, vol. 5567, pp. 295-306. Springer, Heidelberg (2009)
21. n. J. Optimization Theory and Applications 50, 195-200 (1986)