Efficient convex optimization for minimal partition problems with volume constraints

DOI10.1007/978-3-642-40395-8_8MaRDI QIDQ3189634zbMATH OpenOpenAlexFDO

Authors Thomas Möllenhoff, Claudia Nieuwenhuis, Eno Töppe, Daniel Cremers

Publication date 12 September 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40395-8_8

Mathematics Subject Classification ID

Numerical methods involving duality (49M29) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• scientific article; zbMATH DE number 2040634
• Computationally efficient approach for the minimization of volume constrained vector-valued Ginzburg-Landau energy functional
• A Convex Approach to Minimal Partitions
• Minimal partitions and image classification using a gradient-free perimeter approximation
• Variational approximation of interface energies and applications

Cited in

(5)

• On the phase connectedness of the volume-constrained area minimizing partitioning problem
• Midrange geometric interactions for semantic segmentation. Constraints for continuous multi-label optimization
• Computationally efficient approach for the minimization of volume constrained vector-valued Ginzburg-Landau energy functional
• A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem
• Global binary optimization on graphs for classification of high-dimensional data

This page was built for publication: Efficient convex optimization for minimal partition problems with volume constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189634)