Sequential Convex Programming for Computing Information-Theoretic Minimal Partitions: Nonconvex Nonsmooth Optimization

DOI10.1137/16M1078653zbMath1401.49034OpenAlexW2765530422MaRDI QIDQ4689645

Junmo Kim, Daniel Cremers, Yegang Lee, Youngwook Kee, Mohamed Souiai

Publication date: 17 October 2018

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/16m1078653

zbMATH Keywords

difference of convex functionsstochastic optimizationinformation theorytotal variation regularizationimage partitioning

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical methods involving duality (49M29) Computing methodologies for image processing (68U10) Stochastic programming (90C15) Numerical methods of relaxation type (49M20) Numerical methods for variational inequalities and related problems (65K15)

Uses Software

• PMTK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Segmentation of vectorial image features using shape gradients and information measures
• Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Geodesic active contours
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A multiphase level set framework for image segmentation using the Mumford and Shah model
• The calibration method for the Mumford-Shah functional and free-discontinuity problems
• Smoothing methods in statistics
• Completely convex formulation of the Chan-Vese image segmentation model
• A first-order primal-dual algorithm for convex problems with applications to imaging
• DC programming: overview.
• A survey and comparison of discrete and continuous multi-label optimization approaches for the Potts model
• Replica symmetry breaking condition exposed by random matrix calculation of landscape complexity
• Convex Relaxation of Vectorial Problems with Coupled Regularization
• Optimal approximations by piecewise smooth functions and associated variational problems
• Continuous Multiclass Labeling Approaches and Algorithms
• The Split Bregman Method for L1-Regularized Problems
• Divergence measures based on the Shannon entropy
• Remarks on Some Nonparametric Estimates of a Density Function
• Convex Color Image Segmentation with Optimal Transport Distances
• Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
• On the Estimation of Functionals of the Probability Density and Its Derivatives
• A nonparametric estimation of the entropy for absolutely continuous distributions (Corresp.)
• Variational Analysis
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• The Concave-Convex Procedure
• Active contours without edges
• A Convex Approach to Minimal Partitions
• A Convex Max-Flow Approach to Distribution-Based Figure-Ground Separation
• Elements of Information Theory
• On Estimation of a Probability Density Function and Mode
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Sequential Convex Programming for Computing Information-Theoretic Minimal Partitions: Nonconvex Nonsmooth Optimization