AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

A Comparative Study of Graph Matching Algorithms in Computer Vision

Stefan Haller, Lorenz Feineis, Lisa Hutschenreiter, Florian Bernard, Carsten Rother, Dagmar Kainmüller, Paul Swoboda, Bogdan Savchynskyy

ECCV 2022 · Graph learning › Graph algorithms and clustering · approach: Optimization algorithms for graph matching · 17 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
combine a primal heuristic with a dual optimizer (FM-BCA vs FM alone) with larger allowed performance ratioFM-BCA · Graph matching fixed-target (451 instances)solution quality vs run time: performance ratio factor of 3.7Improved
add dual BCA updates to FW and LAP primal heuristics (ablation)MP-FW and MP-LAP heuristics · Graph matching fixed-time evaluationobjective valueImproved
use tighter relaxations (dd-ls3/4 instead of dd-ls0) on short time budgetsdd-ls0 · Graph matching small problems (1s)objective valueHurt
use sparse instead of dense pairwise costs (house-sparse vs house-dense)primal heuristics · house-dense vs house-sparse (1s)objective valueImproved

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