atlas

Research map / Graph learning / Graph algorithms and clustering

Learning Combinatorial Solver for Graph Matching

CVPR 2020 · Graph learning › Graph algorithms and clustering · approach: Deep learning for graph matching · 52 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
Jointly learn assignment-graph node selection and the combinatorial solver rather than learning affinities aloneGraph matching · Willow Objectmatching accuracy (%): PCA 90.2; ours 94.9Helped
Jointly learn assignment-graph node selection and the combinatorial solver rather than relying on learned affinities with a simpler solverGraph matching · Pascal VOC Keypointsmatching accuracy (%): PCA 63.8; ours 68.5Helped
Use the learned graph-matching framework under noise and outliers2D point-set matching · Synthetic 2D Pointsmatching accuracyHelped
Use the learned graph-matching framework across deformation and outlier settingsGraph matching · CMU Housematching accuracyHelped

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