AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Incremental Multi-graph Matching via Diversity and Randomness based Graph Clustering

Tianshu Yu, Junchi Yan, Wei Liu, Baoxin Li

ECCV 2018 · Graph learning › Graph algorithms and clustering · approach: Optimization algorithms for graph matching · 17 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
increase the number of sub-hypergraph clusters d (2, 3, 4) (ablation)IMGM · Synthetic graphs (30 base, 20 arriving)accuracy, consistency and timeMixed
cluster graphs by DPP diversity instead of random sampling (ablation)IMGM · CMU and Willow real image testsaccuracyImproved
cluster graphs by DPP diversity instead of random sampling (ablation)IMGM · Synthetic random graphsaccuracyNo clear effect
partition the hypergraph into changing clusters via an intersection graph instead of a single fixed clusterincremental ConMatch · Synthetic graphsaccuracyImproved
use IMGM partitioning instead of re-optimizing all graphs with incremental CAOCAOPC · Synthetic graphs (35 base, 25 arriving)computing time: about 3 to 4 times of speedupImproved

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