Convex optimization for multi-class image labeling with a novel family of total variation based regularizers

Proceedings of the IEEE International Conference on Computer Vision

Volumn , Issue , 2009, Pages 646-653

  Lellmann, J ^a   Becker, F ^a   Schnorr C ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EUCLIDEAN DISTANCE; IMAGE LABELING; INTER-CLASS DISTANCE; MULTI-CLASS; NON-EUCLIDEAN DISTANCE; NON-TRIVIAL; OPTIMALITY; REAL-WORLD; RELAXED PROBLEM; TOTAL VARIATION; VECTOR FIELDS;

CONVEX OPTIMIZATION; OPTIMIZATION;

COMPUTER VISION;

EID: 77953186768     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCV.2009.5459176     Document Type: Conference Paper

References (23)

1. J.-F. Aujol. Some algorithms for total variation based image restoration. CMLA Preprint, (2008-05), 2008.
2. I. Borg and P. J. F. Groenen. Modern Multidimensional Scaling. Springer, 2nd edition, 2005.
3. Y. Boykov and V. Kolmogorov. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. Patt. Anal. Mach. Intell., 26(9):1124-1137, 2004.
4. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. Patt. Anal. Mach. Intell., 23(11):1222-1239, 2001.
5. A. Chambolle, D. Cremers, and T. Pock. A convex approach for computing minimal partitions. Technical Report 649, Ecole Polytechnique CMAP, 2008.
6. T. F. Chan, S. Esedoḡlu, and M. Nikolova. Algorithms for finding global minimizers of image segmentation and denoising models. J. Appl. Math., 66(5):1632-1648, 2006.
7. V. Duval, J.-F. Aujol, and L. Vese. A projected gradient algorithm for color image decomposition. CMLA Preprint, (2008-21), 2008.
8. J. Gower. Properties of Euclidean and non-Euclidean distance matrices. Lin. Alg. and its Appl., 67:81-97, 1985.
9. H. Ishikawa. Exact optimization for Markov random fields with convex priors. Patt. Anal. Mach. Intell., 25(10):1333-1336, 2003.
10. C. R. Johnson and P. Tarazaga. Connections between the real positive semidefinite and distance matrix completion problems. Lin. Alg. and its Appl., 223-224:375-391, 1995.
11. J. Kleinberg and E. Tardos. Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields. In Found. Comp. Sci., pages 14-23, 1999.
12. V. Kolmogorov and Y. Boykov. What metrics can be approximated by geo-cuts, or global optimization of length/area and flux. Int. Conf. Comp. Vis., 1:564-571, 2005.
13. N. Komodakis and G. Tziritas. Approximate labeling via graph cuts based on linear programming. Patt. Anal. Mach. Intell., 29(8):1436-1453, 2007.
14. J. Lellmann, J. Kappes, J. Yuan, F. Becker, and C. Schnörr. Convex multi-class image labeling by simplex-constrained total variation. Tech. rep., Univ. of Heidelberg, 2008.
15. n. J. Optim. Theory and Appl., 50(1):195-200, 1986.
16. Y. Nesterov. Smooth minimization of non-smooth functions. Math. Prog., 103(1):127-152, 2004.
17. R. Rockafellar. Convex Analysis. Princeton UP, 1970.
18. G. Sapiro and D. L. Ringach. Anisotropic diffusion of multi-valued images with applications to color filtering. In Trans. Image Process., volume 5, pages 1582-1586, 1996.
19. G. Strang. Maximal flow through a domain. Math. Prog., 26:123-143, 1983.
20. 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 Europ. Conf. Comp. Vis., volume 2, pages 19-26, 2006.
21. P. Weiss, G. Aubert, and L. Blanc-Féraud. Efficient schemes for total variation minimization under constraints in image processing. Tech. Rep. 6260, INRIA, 2007.
22. H. Wolkowicz, R. Saigal, and L. Vandenberghe, editors. Handbook of Semidefinite Programming. Kluwer Academic Publishers, 2000.
23. C. Zach, D. Gallup, J.-M. Frahm, and M. Niethammer. Fast global labeling for real-time stereo using multiple plane sweeps. In Vis. Mod. Vis, 2008.