atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Relaxation-Based Preprocessing Techniques for Markov Random Field Inference

CVPR 2016 · Learning theory and algorithms › Combinatorial and search optimization · approach: Structure and complexity of constraint reasoning · 6 citations (OpenAlex)

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 changedWhereMeasuredEffect
Add PR-based preprocessing to α-expansionα-expansion · Vision benchmarksspeedup: 1.5x-12xHelped
Replace DEE with the PR 1-condition (ablation)α-expansion on Color-Seg-n4 · Color-Seg-n4partial persistent variables: 14% moreHelped
Use approximate 2-condition relaxation instead of the 1-condition (ablation)iPR on Color-Seg-n4 · Color-Seg-n4partial persistent variables: additional 10% moreHelped
Use approximate 3-condition relaxation instead of the approximate 2-condition (ablation)iPR on Color-Seg-n4 · Color-Seg-n4partial persistent variablesHelped
Increase the stopping parameter τ (ablation)DEE and PR preprocessing · Color-Seg-n4persistent variable ratioHelped
Increase the stopping parameter τ (ablation)DEE and PR preprocessing · Color-Seg-n4overall running timeMixed
Apply Kovtun preprocessing directly to the multi-label Middlebury problemα-expansion · Middlebury MRF datasetrunning time: at least 5x slowerHurt

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