Abstract
Minimal partition problems describe the task of partitioning a domain into a set of meaningful regions. Two important examples are image segmentation and 3D reconstruction. They can both be formulated as energy minimization problems requiring minimum boundary length or surface area of the regions. This common prior often leads to the removal of thin or elongated structures. Volume constraints impose an additional prior which can help preserve such structures. There exist a multitude of algorithms to minimize such convex functionals under convex constraints. We systematically compare the recent Primal Dual (PD) algorithm [1] to the Alternating Direction Method of Multipliers (ADMM) [2] on volume-constrained minimal partition problems. Our experiments indicate that the ADMM approach provides comparable and often better performance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Pock, T., Chambolle, A.: Diagonal preconditioning for first order primal-dual algorithms in convex optimization. In: Int. Conf. Comp. Vis. (2011)
Eckstein, J., Bertsekas, D.P.: On the Douglas-Rachford Splitting Method and the Proximal Point Algorithm for Maximal Monotone Operators. J. Math. Program. 55, 293–318 (1992)
Unger, M., Pock, T., Cremers, D., Bischof, H.: TVSeg - Interactive Total Variation Based Image Segmentation. In: Brit. Mach. Vis. Conf. (2008)
Santner, J., Pock, T., Bischof, H.: Interactive Multi-Label Segmentation. In: Kimmel, R., Klette, R., Sugimoto, A. (eds.) ACCV 2010, Part I. LNCS, vol. 6492, pp. 397–410. Springer, Heidelberg (2011)
Nieuwenhuis, C., Cremers, D.: Spatially Varying Color Distributions for Interactive Multi-Label Segmentation. IEEE Trans. Pattern Anal. Mach. Intell. (2012)
Töppe, E., Oswald, M.R., Cremers, D., Rother, C.: Image-based 3D Modeling via Cheeger Sets. In: Kimmel, R., Klette, R., Sugimoto, A. (eds.) ACCV 2010, Part I. LNCS, vol. 6492, pp. 53–64. Springer, Heidelberg (2011)
Kolev, K., Pock, T., Cremers, D.: Anisotropic Minimal Surfaces Integrating Photoconsistency and Normal Information for Multiview Stereo. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part III. LNCS, vol. 6313, pp. 538–551. Springer, Heidelberg (2010)
Zach, C., Gallup, D., Frahm, J.M., Niethammer, M.: Fast Global Labeling for Real-Time Stereo Using Multiple Plane Sweeps. In: Vision, Modeling and Visualization Workshop (2008)
Lellmann, J., Schnörr, C.: Continuous Multiclass Labeling Approaches and Algorithms. J. Imaging Sci. 4, 1049–1096 (2010)
Chambolle, A., Pock, T.: A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging. J. Math. Imaging Vis. 40, 120–145 (2011)
Goldstein, T., Bresson, X., Osher, S.: Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction. Technical report, UCLA (2009)
Paul, G., Cardinale, J., Sbalzarini, I.: An Alternating Split Bregman Algorithm for Multi-Region Segmentation. In: IEEE Asilomar Conf. Signals, Systems, and Computers, pp. 426–430 (2011)
Häuser, S., Steidl, G.: Convex Multiclass Segmentation with Shearlet Regularization. Int. J. Comp. Math. 90, 62–81 (2013)
Niethammer, M., Zach, C.: Segmentation with area constraints. Medical Image Analysis 17, 101–112 (2013)
Chambolle, A., Cremers, D., Pock, T.: A Convex Approach for Computing Minimal Partitions. Technical report, University of Bonn (2008)
Pock, T., Cremers, D., Bischof, H., Chambolle, A.: An Algorithm for Minimizing the Piecewise Smooth Mumford-Shah Functional. In: Int. Conf. Comp. Vis. (2009)
Chan, T., Esedoḡlu, S., Nikolova, M.: Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models. J. Appl. Math. 66, 1632–1648 (2006)
Boyle, J.P., Dykstra, R.L.: A method for finding projections onto the intersection of convex sets in Hilbert spaces. Lecture Notes in Statistics, vol. 37, pp. 28–47
Beck, A., Teboulle, M.: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems. J. Img. Sci. 2, 183–202 (2009)
Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers. J. Found. Trends Mach. Learn. 3, 1–122 (2011)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Möllenhoff, T., Nieuwenhuis, C., Töppe, E., Cremers, D. (2013). Efficient Convex Optimization for Minimal Partition Problems with Volume Constraints. In: Heyden, A., Kahl, F., Olsson, C., Oskarsson, M., Tai, XC. (eds) Energy Minimization Methods in Computer Vision and Pattern Recognition. EMMCVPR 2013. Lecture Notes in Computer Science, vol 8081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40395-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-40395-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40394-1
Online ISBN: 978-3-642-40395-8
eBook Packages: Computer ScienceComputer Science (R0)