Efficient Convex Optimization for Minimal Partition Problems with Volume Constraints
From MaRDI portal
Publication:3189634
DOI10.1007/978-3-642-40395-8_8zbMath1303.90082OpenAlexW142380135MaRDI QIDQ3189634
Daniel Cremers, Claudia Nieuwenhuis, Eno Töppe, Thomas Möllenhoff
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
Convex programming (90C25) Numerical methods involving duality (49M29) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (2)
Global binary optimization on graphs for classification of high-dimensional data ⋮ Midrange geometric interactions for semantic segmentation. Constraints for continuous multi-label optimization
This page was built for publication: Efficient Convex Optimization for Minimal Partition Problems with Volume Constraints
