AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Convex Relaxations for Manifold-Valued Markov Random Fields with Approximation Guarantees

Robin Kenis, Emanuel Laude, Panagiotis Patrinos

ECCV 2024 · Optimization › Nonconvex and smooth optimization · approach: Coordinate and Adam convergence analysis · 0 citations (OpenAlex)

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 changedWhereMeasuredEffect
use the polynomial SDP relaxation instead of discretized linear (label-sampling) relaxationsgeodesic chromaticity denoising on S2 · Rooftop/Flowers/Butterfly imagesprimal energy at 1000 s: Rooftop P 3228.25 vs 3288.05 (TRW-S 150 labels)Improved
use linear label-discretization relaxation with up to 150 labelsTRW-S on chromaticity denoising · Butterfly imageconvergence to optimumHurt
use the SDP relaxation on an adversarial S1-valued toy problem with a 180 degree jumpSDP relaxation vs discrete relaxation · S1-valued toy datasetcost at equal memoryHurt
increase LR-Solver labels from 150 to 200 (ablation)LR-Solver · Rooftop denoising 1000 sprimal energy and dual bound: P 3287.44 -> 3402.78; D 3287.44 -> 2782.90Hurt
use degree-2 relaxation with least-squares or ManOpt roundingpose graph optimization · INTEL, MIT, M3500bqualitative solutionMixed

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy