Abstract
The saddle point framework provides a convenient way to formulate many convex variational problems that occur in computer vision. The framework unifies a broad range of data and regularization terms, and is particularly suited for nonsmooth problems such as Total Variation-based approaches to image labeling. However, for many interesting problems the constraint sets involved are difficult to handle numerically. State-of-the-art methods rely on using nested iterative projections, which induces both theoretical and practical convergence issues. We present a dual multiple-constraint Douglas-Rachford splitting approach that is globally convergent, avoids inner iterative loops, enforces the constraints exactly, and requires only basic operations that can be easily parallelized. The method outperforms existing methods by a factor of 4 − 20 while considerably increasing the numerical robustness.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Alberti, G., Bouchitté, G., Dal Maso, D.: The calibration method for the Mumford-Shah functional and free-discontinuity problems. Calculus of Variations and Partial Differential Equations 16(16), 299–333 (2003)
Ambrosio, L., Fusco, N., Pallara, D.: Functions of Bounded Variation and Free Discontinuity Problems. Clarendon Press (2000)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. Patt. Anal. Mach. Intell. 23(11), 1222–1239 (2001)
Chambolle, A., Cremers, D., Pock, T.: A convex approach for computing minimal partitions. Tech. Rep. 649, Ecole Polytechnique CMAP (2008)
Chan, T.F., Esedoḡlu, S., Nikolova, M.: Algorithms for finding global minimizers of image segmentation and denoising models. J. Appl. Math. 66(5), 1632–1648 (2006)
Douglas, J., Rachford, H.H.: On the numerical solution of heat conduction problems in two and three space variables. Trans. of the AMS 82(2), 421–439 (1956)
Eckstein, J.: Splitting Methods for Monotone Operators with Application to Parallel Optimization. Ph.D. thesis, MIT (1989)
Gabay, D.: Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems. In: Applications of the Method of Multipliers to Variational Inequalities, ch. IX, p. 299. North-Holland (1983)
Goldstein, T., Bresson, X., Osher, S.: Geometric applications of the split Bregman method: Segmentation and surface reconstruction. CAM Report 09-06, UCLA (2009)
Goldstein, T., Bresson, X., Osher, S.: Global minimization of Markov random fields with applications to optical flow. CAM Report 09-77, UCLA (2009)
Ishikawa, H.: Exact optimization for Markov random fields with convex priors. Patt. Anal. Mach. Intell. 25(10), 1333–1336 (2003)
Lellmann, J., Becker, F., Schnörr, C.: Convex optimization for multi-class image labeling with a novel family of total variation based regularizers. In: Int. Conf. Comp. Vis (2009)
Lellmann, J., Kappes, J., Yuan, J., Becker, F., Schnörr, C.: Convex multi-class image labeling by simplex-constrained Total Variation. In: Tai, X.-C., Mørken, K., Lysaker, M., Lie, K.-A. (eds.) SSVM 2009. LNCS, vol. 5567, pp. 150–162. Springer, Heidelberg (2009)
Lellmann, J., Schnörr, C.: Continuous multiclass labeling approaches and algorithms. Tech. rep., Univ. of Heidelberg (February 2010), http://www.ub.uni-heidelberg.de/archiv/10460/
Mumford, D., Shah, J.: Optimal approximations by piecewise smooth functions and associated variational problems. Comm. Pure Appl. Math. 42, 577–685 (1989)
Paragios, N., Chen, Y., Faugeras, O. (eds.): The Handbook of Mathematical Models in Computer Vision. Springer, Heidelberg (2006)
Pock, T., Cremers, D., Bischof, H., Chambolle, A.: An algorithm for minimizing the Mumford-Shah functional. In: Int. Conf. Comp. Vis. (2009)
Pock, T., Cremers, D., Bischof, H., Chambolle, A.: Global solutions of variational models with convex regularization. Tech. rep., Graz Univ. of Tech. (2009)
Rockafellar, R.: Convex Analysis. Princeton UP, Princeton (1970)
Setzer, S.: Split Bregman algorithm, Douglas-Rachford splitting and frame shrinkage. In: Tai, X.-C., Mørken, K., Lysaker, M., Lie, K.-A. (eds.) SSVM 2009. LNCS, vol. 5567, pp. 464–476. Springer, Heidelberg (2009)
Strang, G.: Maximal flow through a domain. Math. Prog. 26, 123–143 (1983)
Zach, C., Gallup, D., Frahm, J.M., Niethammer, M.: Fast global labeling for real-time stereo using multiple plane sweeps. In: Vis. Mod. Vis. (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lellmann, J., Breitenreicher, D., Schnörr, C. (2010). Fast and Exact Primal-Dual Iterations for Variational Problems in Computer Vision. In: Daniilidis, K., Maragos, P., Paragios, N. (eds) Computer Vision – ECCV 2010. ECCV 2010. Lecture Notes in Computer Science, vol 6312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15552-9_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-15552-9_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15551-2
Online ISBN: 978-3-642-15552-9
eBook Packages: Computer ScienceComputer Science (R0)