{"url":"/sota/graph-matching-on-imcpt-sparsegm-100","task":{"name":"Graph Matching","url":"/task/graph-matching","note":null},"dataset":{"name":"IMCPT-SparseGM-100","url":"/dataset/imcpt-sparsegm-100"},"category":"Graphs","categories":["Graphs"],"category_note":null,"description":"**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.\n\n\n<span class=\"description-source\">Source: [Consistent Multiple Graph Matching with Multi-layer Random Walks Synchronization ](https://arxiv.org/abs/1712.02575)</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["F1 score"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"F1 score":"higher"}},"counts":{"rows":6,"rows_with_code":6,"rows_with_paper_page":6,"rows_dated":6,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"GCAN-AFAT-U","metrics":{"F1 score":"0.715"},"uses_additional_data":false,"paper_date":"2023-01-01","paper":"/paper/deep-learning-of-partial-graph-matching-via","paper_url":"http://openaccess.thecvf.com//content/CVPR2023/html/Wang_Deep_Learning_of_Partial_Graph_Matching_via_Differentiable_Top-K_CVPR_2023_paper.html","paper_title":"Deep Learning of Partial Graph Matching via Differentiable Top-K","code":"https://github.com/Thinklab-SJTU/ThinkMatch","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"GCAN-AFAT-I","metrics":{"F1 score":"0.709"},"uses_additional_data":false,"paper_date":"2023-01-01","paper":"/paper/deep-learning-of-partial-graph-matching-via","paper_url":"http://openaccess.thecvf.com//content/CVPR2023/html/Wang_Deep_Learning_of_Partial_Graph_Matching_via_Differentiable_Top-K_CVPR_2023_paper.html","paper_title":"Deep Learning of Partial Graph Matching via Differentiable Top-K","code":"https://github.com/Thinklab-SJTU/ThinkMatch","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"NGMv2-AFAT-U","metrics":{"F1 score":"0.703"},"uses_additional_data":false,"paper_date":"2023-01-01","paper":"/paper/deep-learning-of-partial-graph-matching-via","paper_url":"http://openaccess.thecvf.com//content/CVPR2023/html/Wang_Deep_Learning_of_Partial_Graph_Matching_via_Differentiable_Top-K_CVPR_2023_paper.html","paper_title":"Deep Learning of Partial Graph Matching via Differentiable Top-K","code":"https://github.com/Thinklab-SJTU/ThinkMatch","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"NGMv2-AFAT-I","metrics":{"F1 score":"0.701"},"uses_additional_data":false,"paper_date":"2023-01-01","paper":"/paper/deep-learning-of-partial-graph-matching-via","paper_url":"http://openaccess.thecvf.com//content/CVPR2023/html/Wang_Deep_Learning_of_Partial_Graph_Matching_via_Differentiable_Top-K_CVPR_2023_paper.html","paper_title":"Deep Learning of Partial Graph Matching via Differentiable Top-K","code":"https://github.com/Thinklab-SJTU/ThinkMatch","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"NGMv2","metrics":{"F1 score":"0.676"},"uses_additional_data":false,"paper_date":"2023-01-01","paper":"/paper/deep-learning-of-partial-graph-matching-via","paper_url":"http://openaccess.thecvf.com//content/CVPR2023/html/Wang_Deep_Learning_of_Partial_Graph_Matching_via_Differentiable_Top-K_CVPR_2023_paper.html","paper_title":"Deep Learning of Partial Graph Matching via Differentiable Top-K","code":"https://github.com/Thinklab-SJTU/ThinkMatch","n_code_links":1,"syntology":null},{"rank_in_archive_order":6,"model":"PCA-GM","metrics":{"F1 score":"0.575"},"uses_additional_data":false,"paper_date":"2023-01-01","paper":"/paper/deep-learning-of-partial-graph-matching-via","paper_url":"http://openaccess.thecvf.com//content/CVPR2023/html/Wang_Deep_Learning_of_Partial_Graph_Matching_via_Differentiable_Top-K_CVPR_2023_paper.html","paper_title":"Deep Learning of Partial Graph Matching via Differentiable Top-K","code":"https://github.com/Thinklab-SJTU/ThinkMatch","n_code_links":1,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,821 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":6821,"papers_extracted_not_yet_verified":65,"boards_without_verdict":29,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":0,"rows_with_any_sample_ran":0,"distinct_papers_with_graph_line":0,"distinct_papers_with_any_sample_ran":0,"samples_over_distinct_papers":{"n_ran":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":0,"n_unverified":0,"n_samples":0,"n_pointer_only_licence":0,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}