The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
A convex relaxation approach for computing minimal partitions
Abstract
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts model) in terms of a primal dual Total Variation functional. We show that the Potts prior can be incorporated by means of convex constraints on the dual variables. For minimization we propose an efficient primal dual projected gradient algorithm which also allows a fast implementation on parallel hardware. Although our approach does not guarantee to find global minimizers of the Potts model we can give a tight bound on the energy between the computed solution and the true minimizer. Furthermore we show that our relaxation approach dominates recently proposed relaxations. As a consequence, our approach allows to compute solutions closer to the true minimizer. For many practical problems we even find the global minimizer. We demonstrate the excellent performance of our approach on several multi-label image segmentation and stereo problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Chan, T. F., & Vese, L. A. (2001) · IEEE Transactions on Image Processing · doi:10.1109/83.902291 · Cited by 10,304
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
Optimal approximations by piecewise smooth functions and associated variational problems
Mumford, D., & Shah, J. (1989) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160420503 · Cited by 5,208
Beitrag zur Theorie des Ferromagnetismus
Ising, E. (1925) · Zeitschrift für Physik · doi:10.1007/bf02980577 · Cited by 3,871
chambolle (2004) · doi:10.1023/b:jmiv.0000011321.19549.88 · Cited by 3,227
What energy functions can be minimized via graph cuts?
Kolmogorov, V., & Zabih, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262177 · Cited by 3,127
Introduction to linear optimization
Bertsimas, D., & Tsitsiklis, J. N. (1997) · Cited by 2,705
Some generalized order-disorder transformations
Potts, R. B. (1952) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100027419 · Cited by 2,122
Markov Random Fields and Their Applications
Kindermann, R., & Snell, J. L. (1980) · Contemporary Mathematics · doi:10.1090/conm/001 · Cited by 1,290
Exact Maximum A Posteriori Estimation for Binary Images
Greig, D. M., Porteous, B. T., & Seheult, A. H. (1989) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1989.tb01764.x · Cited by 1,055
Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
Chan, T. F., Esedoglu, S., & Nikolova, M. (2006) · SIAM Journal on Applied Mathematics · doi:10.1137/040615286 · Cited by 1,049
Studies in Linear and Non-Linear Programming.
Beale, E. M. L., Arrow, K. J., Hurwicz, L., Uzawa, H., Chenery, H. B., Johnson, S. M., Karlin, S., Marschak, T., & Solow, R. M. (1959) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2342801 · Cited by 915
A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
Chan, T. F., Golub, G. H., & Mulet, P. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596299767 · Cited by 840
MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
Wainwright, M. J., Jaakkola, T. S., & Willsky, A. S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.856938 · Cited by 654
Computing geodesics and minimal surfaces via graph cuts
Boykov, & Kolmogorov (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238310 · Cited by 555
Studies in Linear and Non-Linear Programming.
Suzuki, G., Arrow, K. J., Hurwicz, L., & Uzawa, H. (1959) · Mathematical Tables and Other Aids to Computation · doi:10.2307/2002823 · Cited by 520
Exact optimization for markov random fields with convex priors
Ishikawa, H. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1233908 · Cited by 486
Optimizing Binary MRFs via Extended Roof Duality
Rother, C., Kolmogorov, V., Lempitsky, V., & Szummer, M. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383203 · Cited by 427
A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces
Boyle, J. P., & Dykstra, R. L. (1986) · Lecture Notes in Statistics · doi:10.1007/978-1-4613-9940-7_3 · Cited by 415
Sur les prolemes aux derives partielles et leur signification physique
Hadamard, J. (1902) · Medical Entomology and Zoology · Cited by 364
Roof duality, complementation and persistency in quadratic 0–1 optimization
Hammer, P. L., Hansen, P., & Simeone, B. (1984) · Mathematical Programming · doi:10.1007/bf02612354 · Cited by 316
A Convex Formulation of Continuous Multi-label Problems
Pock, T., Schoenemann, T., Graber, G., Bischof, H., & Cremers, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88690-7_59 · Cited by 196
Self-citationConvex Multi-class Image Labeling by Simplex-Constrained Total Variation
Lellmann, J., Kappes, J. H., Yuan, J. Y., Becker, F., & Schnörr, C. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02256-2_13 · Cited by 159
Fast Global Labeling for Real-Time Stereo Using Multiple Plane Sweeps.
Zach, C., Gallup, D., Frahm, J., & Niethammer, M. (2008) · Vision Modeling and Visualization · Cited by 148
TRANSFORMING AN ARBITRARY MINSUM PROBLEM INTO A BINARY ONE
Schlesinger, D., & Flach, B. (2006) · Cited by 96
Pattern Theory: The Stochastic Analysis of Real-World Signals
Mumford, D., & Desolneux, A. (2010) · Thammasat University Digital Collections · Cited by 93
An Experimental Comparison of Discrete and Continuous Shape Optimization Methods
Klodt, M., Schoenemann, T., Kolev, K., Schikora, M., & Cremers, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88682-2_26 · Cited by 75
Self-citationA convex approach for computing minimal partitions
Informatik, U., Chambolle, A., Cremers, D., & Pock, T. (2008) · Cited by 74
Self-citation
Cited by
A Survey of Optimization Methods From a Machine Learning Perspective
Sun, S., Cao, Z., Zhu, H., & Zhao, J. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2950779 · Cited by 789
Komodakis, N., & Pesquet, J.-C. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2377273 · Cited by 419
An algorithm for minimizing the Mumford-Shah functional
Pock, T., Cremers, D., Bischof, H., & Chambolle, A. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459348 · Cited by 353
Self-citationNormalized Cut Loss for Weakly-Supervised CNN Segmentation
Tang, M., Djelouah, A., Perazzi, F., Boykov, Y., & Schroers, C. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00195 · Cited by 336
Simultaneous Optical Flow and Intensity Estimation from an Event Camera
Bardow, P., Davison, A. J., & Leutenegger, S. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.102 · Cited by 295
Metadata
- Authors
- Pock, T., Chambolle, A., Cremers, D., & Bischof, H.
- Venue
- 2009 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2009-06
- Pages
- 810-817
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2155697938
- Cited by
- 253
- References
- 28
- FWCI
- 19.36
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.