Browse › Graphs › Graph Matching › PASCAL VOC

Graph Matching archive 2025-07-28

PASCAL VOC Benchmark (Graph Matching)

31 rows 24 with code listed 2 metrics Dataset page

Syntology Since the archive (Syntology): none placed; no newer paper judged to report on this board so far.

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

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, not an evaluation date; 31 of 31 rows carry one.

The chart needs JavaScript; the table below carries every value.

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.0050.818 – Paper – 2022 no code linked report
2 BBGM-Multi 0.628 – Paper Code 2020 community repositories only · 10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 1 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.6140.801 – Paper Code 2020 community repositories only · 10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 1 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.4290.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 official (archive's flag): 7 ran · 7 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 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 official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified report
23 qc-DGM1 0.693 – Paper Code 2021 official (archive's flag): 2 ran · 2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 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 ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”: of the code samples Syntology harvested from repositories linked to that row's paper (joined by arXiv id), N executed on a synthesized input and U are unverified (harvested, no recorded run). Of the N, C constructed an object rather than computing a result (a part of N, never taken away from it), K ran with no instrument failure (honoured or violated the contract Syntology drafted, or ran with no contract checked) and I are failures of Syntology's instrument, not of the code (a wrong contract draft, or a contract check that could not 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. Rows whose paper has a sample that ran: 5 (3 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument). Papers: 3 with a sample that ran: 2 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument. Whose code ran. When the archive marks a repository official for the row's paper, the cell starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code): “official (archive's flag): N ran” counts the samples from it that ran, instrument failures included; “official: harvested, nothing ran”; when it has no sample for this paper and other samples ran, “community repositories only” if every one came from a repository the archive lists for the paper but neither marks official nor records as mentioned in it, or one Syntology harvested outside the archive's links, and “official: no sample here; runs from other or unrecorded repositories” if any came from a repository named in the paper or found in its text by Syntology, or has no repository recorded; “official: harvested for another paper” (no sample from it is linked to this paper) or “official: not harvested”. No state is printed when the archive marks none official. The cell's tooltip names the repositories the samples that ran came from. Of the 5 rows with a graph line, 5 have an archive-official repository: on 3 a sample from it ran (1 with a run with no instrument failure), on 2 the samples that ran came from community repositories only, and on 0 from other or unrecorded repositories. The filters above hide rows and never renumber them; the first two count, by default, only a run with no instrument failure, and offer any run, instrument failures included. Counting each paper once, of 20 samples: 19 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 2 violated, 5 with no contract checked; 12 where Syntology's instrument failed) · 1 unverified. Separately, 14 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. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. Per-sample status is on the paper page; each Ran cell links to that paper's sample list. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.

Since the archive Syntology

Of the 8,888 newer papers whose tables Syntology has read (8,886 checked in full and 2 with a leaderboard still awaiting a verdict), 1 had this board among the leaderboards the extractor considered for their tables (it keeps at most 10 boards per paper and 4 per dataset; the lists of 1,595 of the 8,888 were already full without this board, so if it was crowded out of them it is not counted), and none proposed a result, so none await a verdict and none were placed. Syntology has checked 8,886 of the 18,637 papers on this site that are newer than the archive (for 3,717 of them no archive leaderboard matched the paper's tables, so there was nothing further to check); 733 were read and have nothing to place (arXiv has no HTML version of the paper, or that version has no tables), 41 could not be read (the extractor's reply could not be parsed), and results from the other 8,977 appear after they are checked.

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