Browse › Graphs › Graph Matching › PASCAL VOC
PASCAL VOC Benchmark (Graph Matching)
Graph Matching is the problem of finding correspondences between two sets of vertices while preserving complex relational information among them. Since the graph structure has a strong capacity to represent objects and robustness to severe deformation and outliers, it is frequently adopted to formulate various correspondence problems in the field of computer vision. Theoretically, the Graph Matching problem can be solved by exhaustively searching the entire solution space. However, this approach is infeasible in practice because the solution space expands exponentially as the size of input data increases. For that reason, previous studies have attempted to solve the problem by using various approximation techniques.
Source: Consistent Multiple Graph Matching with Multi-layer Random Walks Synchronization
The archive carries no text for this table; the description above is the archive's text for the task Graph Matching. archive 2025-07-28
Over time archive 2025-07-28
The chart needs JavaScript; the table below carries every value.
Direction inferred from the metric name, not from the archive: F1 score (higher is better), matching accuracy (higher is better). Points are placed at the row's paper date; 31 of 31 rows carry one.
Results archive 2025-07-28
Archive rows end at the archive snapshot, 2025-07-28: no result published after that date is in this table. Rank is the archive's row order at that snapshot; not re-ranked here. Metric values are the archive's strings. Column headers sort the table in your browser; each row keeps its archive rank.
| Paper | Code | Ran Syntology | Report | ||||||
|---|---|---|---|---|---|---|---|---|---|
| 1 | URL | 0.717±0.005 | 0.818 | – | Paper | – | 2022 | no code linked | report |
| 2 | BBGM-Multi | 0.628 | – | Paper | Code | 2020 | 5 of 11 ran · 6 unverified | report | |
| 3 | GCAN-AFAT-U | 0.620 | – | Paper | Code | 2023 | linked, not harvested | report | |
| 4 | GCAN-AFAT-I | 0.616 | – | Paper | Code | 2023 | linked, not harvested | report | |
| 5 | BBGM | 0.614 | 0.801 | – | Paper | Code | 2020 | 5 of 11 ran · 6 unverified | report |
| 6 | NGMv2-AFAT-U | 0.602 | – | Paper | Code | 2023 | linked, not harvested | report | |
| 7 | Direct-2HGM | 0.601 | – | Paper | Code | 2022 | linked, not harvested | report | |
| 8 | NGMv2-AFAT-I | 0.599 | – | Paper | Code | 2023 | linked, not harvested | report | |
| 9 | Direct-2GM | 0.597 | – | Paper | Code | 2022 | linked, not harvested | report | |
| 10 | GUMBEL-IPF | 0.588 | – | Paper | Code | 2024 | linked, not harvested | report | |
| 11 | Direct-MGM | 0.575 | – | Paper | Code | 2022 | linked, not harvested | report | |
| 12 | MGM3D | 0.429 | 0.589 | – | Paper | – | 2021 | no code linked | report |
| 13 | GMT-BBGM | 0.8411 | – | Paper | Code | 2023 | linked, not harvested | report | |
| 14 | GMTR | 0.836 | – | Paper | Code | 2023 | linked, not harvested | report | |
| 15 | COMMON | 0.8267 | – | Paper | Code | 2022 | 7 of 7 ran · 0 unverified | report | |
| 16 | GCAN | 0.8223 | – | Paper | Code | 2022 | linked, not harvested | report | |
| 17 | CREAM | 0.814 | – | Paper | Code | 2024 | linked, not harvested | report | |
| 18 | ASAR-GM | 0.8115 | – | Paper | Code | 2022 | linked, not harvested | report | |
| 19 | GAMnet | 0.807 | – | Paper | – | 2021 | no code linked | report | |
| 20 | NHGM-v2 | 0.8040 | – | Paper | Code | 2019 | linked, not harvested | report | |
| 21 | EAGM | 0.705 | – | Paper | Code | 2021 | linked, not harvested | report | |
| 22 | qc-DGM2 | 0.703 | – | Paper | Code | 2021 | 2 of 2 ran · 0 unverified | report | |
| 23 | qc-DGM1 | 0.693 | – | Paper | Code | 2021 | 2 of 2 ran · 0 unverified | report | |
| 24 | HNN-HM | 0.680 | – | Paper | Code | 2021 | linked, not harvested | report | |
| 25 | IPCA-GM | 0.6770 | – | Paper | Code | 2020 | linked, not harvested | report | |
| 26 | CIE-H | 0.6756 | – | Paper | – | 2020 | no code linked | report | |
| 27 | GLMNet | 0.675 | – | Paper | – | 2019 | no code linked | report | |
| 28 | IA-GM | 0.6658 | – | Paper | – | 2021 | no code linked | report | |
| 29 | NHGM | 0.6458 | – | Paper | Code | 2019 | linked, not harvested | report | |
| 30 | NGM | 0.6413 | – | Paper | Code | 2019 | linked, not harvested | report | |
| 31 | GMN | 0.6240 | – | Paper | – | 2018 | no code linked | report |
All 31 rows shown. 31 link to a paper page on this site; 0 are marked as using additional training data in the archive. No GitHub stars are tracked; "Code" is the first repository the archive lists for the row. The archive carries no row tags, review links or community-submitted rows for this table; none are shown. archive 2025-07-28
Syntology Ran reads "N of M ran · U unverified": of the M code samples Syntology harvested from repositories linked to that row's paper (joined by arXiv id), N executed on a synthesized input and the other U = M−N are unverified (harvested, no recorded run). It counts code from repositories linked to that row's paper, not this result: the row's number was not reproduced and nothing here is a correctness claim. The other cell texts mean no graph line for the row: "linked, not harvested" (the archive links code, Syntology has not harvested it), "no code linked" (no code link in the archive), "not matched" (the row's paper URL matched no paper on this site). 5 rows have a graph line, from 3 distinct papers; 5 rows (3 papers) have at least one sample that ran. Counting each paper once: Syntology ran 14 of 20 samples; 6 unverified. Separately, 12 of those 20 are pointer-only (licence): the site points at that code rather than redistributing it, a licence property recorded for ran and unverified samples alike; each cell's tooltip carries the row's own pointer-only count. Read from the graph 2026-09-24. Per-sample status is on the paper page.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections