Research map / Graph learning / Graph algorithms and clustering
An Efficient Multilinear Optimization Framework for Hypergraph Matching
Quynh Nguyen, Francesco Tudisco, Antoine Gautier, Matthias Hein
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 |
|---|---|---|---|
| use fourth-order lifting instead of third-order scheme (standard) (ablation) | BCAGM3 · Synthetic | matching score test cases: 241 vs 292 test cases better; avg gain 51.9 vs 347.0 | Mixed |
| use fourth-order lifting instead of third-order scheme (standard) (ablation) | BCAGM3 · CMU House | matching score test cases: 2 vs 7 test cases better | Hurt |
| use fourth-order lifting instead of third-order scheme (standard) (ablation) | BCAGM3 · Willow Face+Duck+Winebottle | matching score test cases: 6277 vs 7130 test cases better | Mixed |
| use fourth-order lifting instead of third-order scheme (standard) (ablation) | BCAGM3+MP · Synthetic | matching score test cases: 194 vs 243 test cases better; avg gain 43.4 vs 237.1 | Hurt |
| use fourth-order lifting instead of third-order scheme (standard) | BCAGM3+IPFP · CMU House | matching score test cases: 19 vs 5 test cases better | Improved |
| switch to adaptive third-order from standard third-order, compared to fourth-order | Adapt-BCAGM3 · Willow Face+Duck+Winebottle | matching score test cases: 6717 vs 5621 test cases better | Improved |
| use fourth-order adaptive instead of third-order adaptive (ablation) | Adapt-BCAGM3 · Synthetic | matching score test cases: 269 vs 239 test cases better | Mixed |
| use fourth-order adaptive instead of third-order adaptive | Adapt-BCAGM3+IPFP · Willow Face+Duck+Winebottle | matching score test cases: 10774 vs 6318 test cases better | Improved |
| add adaptive homotopy update of alpha (ablation) | BCAGM3 family · Willow Face+Duck+Wine bottle (4200 cases per class) | matching score | Improved |
| use third-order tensors instead of lifted fourth-order | BCAGM family · Running time | runtime: two times faster | Improved |
| use MPM as subroutine with higher-order affinity | BCAGM3+MP · Synthetic with scaling 1.5, sigma 0.03 | accuracy | Improved |
| use pairwise-distance affinities (MPM, IPFP) instead of triangle-angle third-order affinity (ablation) | MPM, IPFP · Synthetic with scale change | accuracy | Hurt |
Closest papers by meaning
- A Comparative Study of Graph Matching Algorithms in Computer Vision (ECCV 2022 · similarity 0.88)
- A CUR Decomposition-Based Mix-Order Framework for Large-Scale Hypergraph Matching (TPAMI 2026 · similarity 0.88)
- A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching (CVPR 2017 · similarity 0.87)
- Tensor Power Iteration for Multi-Graph Matching (CVPR 2016 · similarity 0.87)
- CURSOR: Scalable Mixed-Order Hypergraph Matching with CUR Decomposition (CVPR 2024 · similarity 0.87)
- HiPPI: Higher-Order Projected Power Iterations for Scalable Multi-Matching (ICCV 2019 · 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.
