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
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Jointly optimize graph cuts and partition matching with CutMatch | Synthetic graphs with noise, displacement, and feature permutation · Synthetic joint cut and matching | matching accuracy | Improved |
| Jointly optimize graph cuts and partition matching with CutMatch | Synthetic graphs with noise, displacement, and feature permutation · Synthetic joint cut and matching | cuts accuracy | Improved |
| Jointly optimize graph cuts and partition matching with CutMatch | Real images containing two similar objects · Real-image joint cut and matching | matching accuracy | Improved |
| Jointly optimize graph cuts and partition matching with CutMatch | Real images containing two similar objects · Real-image joint cut and matching | cuts accuracy | Improved |
| Use IBGP for standard two-graph matching | Synthetic graph pairs · Synthetic standard graph matching | matching accuracy | Mixed |
| Use balanced cuts instead of raw graph cuts | Synthetic graphs · Supplementary balanced-cut experiment | cuts accuracy | No clear effect |
Closest papers by meaning
- The Product Cut (NeurIPS 2016 · similarity 0.88)
- Graph Matching: Relax at Your Own Risk (TPAMI 2016 · similarity 0.87)
- A Comparative Study of Graph Matching Algorithms in Computer Vision (ECCV 2022 · similarity 0.87)
- Incremental Multi-graph Matching via Diversity and Randomness based Graph Clustering (ECCV 2018 · similarity 0.86)
- A Convex Relaxation for Multi-Graph Matching (CVPR 2019 · similarity 0.86)
- Multiple Graph Matching and Clustering via Decayed Pairwise Matching Composition (AAAI 2020 · similarity 0.86)
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.
