AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Zero-Assignment Constraint for Graph Matching With Outliers

Fudong Wang, Nan Xue, Jin-Gang Yu, Gui-Song Xia

CVPR 2020 · Graph learning › Graph algorithms and clustering · approach: Optimization algorithms for graph matching · 17 citations (OpenAlex)

Check 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 regularization instead of the explicit cardinality constraint (ablation)ZAC graph matching · PASCALmatching accuracyImproved
Use regularization instead of the explicit cardinality constraint (ablation)ZAC graph matching · PASCALrunning time: 0.18 -> 0.53 (0 outliers); 0.56 -> 1.36 (20 outliers)Hurt
Use zero-assignment-based outlier identification and removalZAC and ZACR · PASCALprecisionImproved
Use zero-assignment-based graph matchingZAC and ZACR · VGGrecallImproved
Use zero-assignment-based graph matchingZAC and ZACR · Rigid deformable graph matching, 100% outliersaverage error: GLS: 0.044; CPD: 0.135; ZAC: 0.006; ZACR: 0.006Improved
Use zero-assignment-based graph matchingZAC and ZACR · Non-rigid deformable graph matching, 100% outliersaverage error: GLS: 0.092; CPD: 0.083; ZAC: 0.032; ZACR: 0.032Improved

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