Research map / Graph learning / Graph algorithms and clustering
Multi-Graph Matching via Affinity Optimization with Graduated Consistency Regularization
Junchi Yan, Minsu Cho, Hongyuan Zha B, Xiaokang Yang, Stephen Mingyu Chu
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 |
|---|---|---|---|
| add consistency-driven inlier eliciting mask to ISB-GC when outliers are many | ISB-GC · Willow-ObjectClass and synthetic point sets with outliers | matching accuracy | Improved |
| leave consistency out of the final stage (partial consistency instead of full consistency) (ablation) | ISB-GC · CMU-POSE (partial similarity) | matching accuracy | Improved |
Closest papers by meaning
- Determinant Regularization for Gradient-Efficient Graph Matching (CVPR 2020 · similarity 0.90)
- Incremental Multi-graph Matching via Diversity and Randomness based Graph Clustering (ECCV 2018 · similarity 0.90)
- Learning With Partial and Noisy Correspondence in Graph Matching (TPAMI 2026 · similarity 0.89)
- Discrete Cycle-Consistency Based Unsupervised Deep Graph Matching (AAAI 2024 · similarity 0.87)
- Learning Partial Graph Matching via Optimal Partial Transport (ICLR 2025 · similarity 0.87)
- Multi-Shape Matching with Cycle Consistency Basis via Functional Maps (AAAI 2025 · similarity 0.87)
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.
