Research map / Learning theory and algorithms / Submodular and game algorithms
Rounding-based Moves for Semi-Metric Labeling
M. Pawan Kumar, Puneet K. Dokania
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 hierarchical move-making (HIER) instead of expansion (EXP) | stereo MRF · tsukuba stereo, truncated quadratic | energy: 1546777 -> 1499134 | Improved |
| use HIER instead of TRW | stereo MRF · tsukuba stereo, truncated quadratic | energy: 1415343 -> 1499134 | Improved |
| use HIER instead of belief propagation | stereo MRF · venus stereo, truncated quadratic | energy: 4183829 -> 3210882 | Improved |
| use HIER instead of SWAP | stereo MRF · teddy stereo, truncated linear | energy: 1606891 -> 1596279 | Improved |
| use HIER instead of TRW on teddy | stereo MRF · teddy stereo, truncated linear | energy: 1605057 -> 1596279 | Improved |
| use interval move-making (INT) instead of EXP | stereo MRF · venus stereo, truncated linear | energy: 2953157 -> 2959133 | Hurt |
| use INT instead of HIER in compute time | stereo MRF · teddy stereo, truncated quadratic | time: 363.2s -> 2108.6s | Hurt |
| use rounding-based moves instead of LP-relaxation TRW in time | stereo MRF · tsukuba stereo, truncated linear | time: 55.8s -> 3.3s | Improved |
Closest papers by meaning
- LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program (TPAMI 2016 · similarity 0.87)
- Relaxation-Based Preprocessing Techniques for Markov Random Field Inference (CVPR 2016 · similarity 0.85)
- Sublabel-Accurate Relaxation of Nonconvex Energies (CVPR 2016 · similarity 0.83)
- A Scalable Constant-Factor Approximation Algorithm for $W_p$ Optimal Transport (ICLR 2026 · similarity 0.83)
- Scalable Approximation Algorithms for $p$-Wasserstein Distance and Its Variants (ICML 2025 · similarity 0.82)
- Simple Randomized Rounding for Max-Min Eigenvalue Augmentation (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.
