AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Joint Cuts and Matching of Partitions in One Graph

Tianshu Yu, Junchi Yan, Jieyi Zhao, Baoxin Li

CVPR 2018 · Graph learning › Graph algorithms and clustering · approach: Optimization algorithms for graph matching · 12 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
Jointly optimize graph cuts and partition matching with CutMatchSynthetic graphs with noise, displacement, and feature permutation · Synthetic joint cut and matchingmatching accuracyImproved
Jointly optimize graph cuts and partition matching with CutMatchSynthetic graphs with noise, displacement, and feature permutation · Synthetic joint cut and matchingcuts accuracyImproved
Jointly optimize graph cuts and partition matching with CutMatchReal images containing two similar objects · Real-image joint cut and matchingmatching accuracyImproved
Jointly optimize graph cuts and partition matching with CutMatchReal images containing two similar objects · Real-image joint cut and matchingcuts accuracyImproved
Use IBGP for standard two-graph matchingSynthetic graph pairs · Synthetic standard graph matchingmatching accuracyMixed
Use balanced cuts instead of raw graph cutsSynthetic graphs · Supplementary balanced-cut experimentcuts accuracyNo clear effect

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