Research map / Learning theory and algorithms / Combinatorial and search optimization
Adaptive and Move Making Auxiliary Cuts for Binary Pairwise Energies
Check your idea against 108,967 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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use distance and unary preference to select auxiliary bounds | LSA-AUX on Chinese characters inpainting · Chinese characters inpainting | mean energy: -49547.61 -> -49548.78 | Helped |
| Use distance and unary preference to select auxiliary bounds | LSA-AUX on Chinese characters inpainting · Chinese characters inpainting | mean runtime: 2053.89 sec -> 0.07 sec | Helped |
| Use adaptive bounds selected by the proposed criteria | LSA-AUX on segmentation with repulsion · Segmentation with repulsion | energy | Helped |
| Use pairwise ICM preference or unary preference for bound selection | LSA-AUX on binary deconvolution · Binary deconvolution | energy | Helped |
| Select bounds using distance preference | LSA-AUX on multi-region liver segmentation · Multi-region liver segmentation | energy: 410751 -> 409738 | Helped |
| Select bounds using distance and unary preference | LSA-AUX on generalized compact shape prior segmentation · Generalized compact shape prior segmentation | energy: 0 -> -336649 | Helped |
| Add expansion moves to distance-and-unary adaptive bounds (ablation) | AUX-DIST-U on generalized compact shape prior segmentation · Generalized compact shape prior segmentation | energy: -312618 -> -336649 | Helped |
| Add expansion moves to distance-and-unary adaptive bounds (ablation) | AUX-DIST-U on generalized compact shape prior segmentation · Generalized compact shape prior segmentation | runtime: 31s -> 4.69s | Helped |
| Select bounds using unary preference | LSA-AUX on squared curvature · Squared curvature | energy | Helped |
Closest papers by meaning
- DOPE: Distributed Optimization for Pairwise Energies (CVPR 2017 · similarity 0.85)
- Truncated Max-Of-Convex Models (CVPR 2017 · similarity 0.84)
- Sublabel-Accurate Relaxation of Nonconvex Energies (CVPR 2016 · similarity 0.84)
- Optimal approximation for unconstrained non-submodular minimization (ICML 2020 · similarity 0.83)
- Graph Cuts Always Find a Global Optimum for Potts Models (With a Catch) (ICML 2021 · similarity 0.83)
- Discrete and Continuous Difference of Submodular Minimization (ICML 2025 · similarity 0.81)
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.