Research map / Label-efficient and robust learning / Recognition and long-tail
A Cutting-Plane Method for Sublabel-Accurate Relaxation of Problems with Product Label Spaces
Zhenzhang Ye, Bjoern Haefner, Yvain Quéau, Thomas Möllenhoff, Daniel Cremers
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Sublabel-Accurate Relaxation of Nonconvex Energies (CVPR 2016 · similarity 0.93)
- Sublabel-Accurate Convex Relaxation of Vectorial Multilabel Energies (ECCV 2016 · similarity 0.92)
- Lifting Vectorial Variational Problems: A Natural Formulation Based on Geometric Measure Theory and Discrete Exterior Calculus (CVPR 2019 · similarity 0.88)
- Sublabel-Accurate Discretization of Nonconvex Free-Discontinuity Problems (ICCV 2017 · similarity 0.86)
- MRF Optimization with Separable Convex Prior on Partially Ordered Labels (ECCV 2018 · similarity 0.86)
- Complexity of Discrete Energy Minimization Problems (ECCV 2016 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
