{"task":"Graph Matching","dataset":"PASCAL VOC","metric_names":["F1 score","matching accuracy"],"rows":[{"id":54514,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"URL","metrics":{"F1 score":"0.717±0.005","matching accuracy":"0.818"},"paper_url":"https://arxiv.org/abs/2212.00780v2","paper_title":"Universe Points Representation Learning for Partial Multi-Graph Matching","paper_date":"2022-12-01","code_links":[],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54515,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"BBGM-Multi","metrics":{"F1 score":"0.628"},"paper_url":"https://arxiv.org/abs/2003.11657v2","paper_title":"Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers","paper_date":"2020-03-25","code_links":[{"title":"Thinklab-SJTU/ThinkMatch","url":"https://github.com/Thinklab-SJTU/ThinkMatch"},{"title":"martius-lab/blackbox-backprop","url":"https://github.com/martius-lab/blackbox-backprop"},{"title":"martius-lab/blackbox-deep-graph-matching","url":"https://github.com/martius-lab/blackbox-deep-graph-matching"},{"title":"LPMP/LPMP","url":"https://github.com/LPMP/LPMP"},{"title":"q3erf/topo_bbgm","url":"https://github.com/q3erf/topo_bbgm"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54516,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"GCAN-AFAT-U","metrics":{"F1 score":"0.620"},"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","paper_date":"2023-01-01","code_links":[{"title":"Thinklab-SJTU/ThinkMatch","url":"https://github.com/Thinklab-SJTU/ThinkMatch"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54517,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"GCAN-AFAT-I","metrics":{"F1 score":"0.616"},"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","paper_date":"2023-01-01","code_links":[{"title":"Thinklab-SJTU/ThinkMatch","url":"https://github.com/Thinklab-SJTU/ThinkMatch"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54518,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"BBGM","metrics":{"F1 score":"0.614","matching accuracy":"0.801"},"paper_url":"https://arxiv.org/abs/2003.11657v2","paper_title":"Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers","paper_date":"2020-03-25","code_links":[{"title":"Thinklab-SJTU/ThinkMatch","url":"https://github.com/Thinklab-SJTU/ThinkMatch"},{"title":"martius-lab/blackbox-backprop","url":"https://github.com/martius-lab/blackbox-backprop"},{"title":"martius-lab/blackbox-deep-graph-matching","url":"https://github.com/martius-lab/blackbox-deep-graph-matching"},{"title":"LPMP/LPMP","url":"https://github.com/LPMP/LPMP"},{"title":"q3erf/topo_bbgm","url":"https://github.com/q3erf/topo_bbgm"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54519,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"NGMv2-AFAT-U","metrics":{"F1 score":"0.602"},"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","paper_date":"2023-01-01","code_links":[{"title":"Thinklab-SJTU/ThinkMatch","url":"https://github.com/Thinklab-SJTU/ThinkMatch"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54520,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"Direct-2HGM","metrics":{"F1 score":"0.601"},"paper_url":"https://proceedings.mlr.press/v206/indelman23a.html","paper_title":"Learning Constrained Structured Spaces with Application to Multi-Graph Matching","paper_date":"2022-05-03","code_links":[{"title":"HeddaCohenIndelman/Learning-Constrained-Structured-Spaces-with-Application-to-Multi-Graph-Matching","url":"https://github.com/HeddaCohenIndelman/Learning-Constrained-Structured-Spaces-with-Application-to-Multi-Graph-Matching"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54521,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"NGMv2-AFAT-I","metrics":{"F1 score":"0.599"},"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","paper_date":"2023-01-01","code_links":[{"title":"Thinklab-SJTU/ThinkMatch","url":"https://github.com/Thinklab-SJTU/ThinkMatch"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54522,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"Direct-2GM","metrics":{"F1 score":"0.597"},"paper_url":"https://proceedings.mlr.press/v206/indelman23a.html","paper_title":"Learning Constrained Structured Spaces with Application to Multi-Graph Matching","paper_date":"2022-05-03","code_links":[{"title":"HeddaCohenIndelman/Learning-Constrained-Structured-Spaces-with-Application-to-Multi-Graph-Matching","url":"https://github.com/HeddaCohenIndelman/Learning-Constrained-Structured-Spaces-with-Application-to-Multi-Graph-Matching"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54523,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"GUMBEL-IPF","metrics":{"F1 score":"0.588"},"paper_url":"https://proceedings.mlr.press/v238/cohen-indelman24a.html","paper_title":"Learning Latent Partial Matchings with Gumbel-IPF Networks","paper_date":"2024-04-03","code_links":[{"title":"HeddaCohenIndelman/Learning-Latent-Partial-Matchings-with-Gumbel-IPF-Networks","url":"https://github.com/HeddaCohenIndelman/Learning-Latent-Partial-Matchings-with-Gumbel-IPF-Networks"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54524,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"Direct-MGM","metrics":{"F1 score":"0.575"},"paper_url":"https://proceedings.mlr.press/v206/indelman23a.html","paper_title":"Learning Constrained Structured Spaces with Application to Multi-Graph Matching","paper_date":"2022-05-03","code_links":[{"title":"HeddaCohenIndelman/Learning-Constrained-Structured-Spaces-with-Application-to-Multi-Graph-Matching","url":"https://github.com/HeddaCohenIndelman/Learning-Constrained-Structured-Spaces-with-Application-to-Multi-Graph-Matching"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54525,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"MGM3D","metrics":{"F1 score":"0.429","matching accuracy":"0.589"},"paper_url":"https://arxiv.org/abs/2103.17229v2","paper_title":"Joint Deep Multi-Graph Matching and 3D Geometry Learning from Inhomogeneous 2D Image Collections","paper_date":"2021-03-31","code_links":[],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54526,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"GMT-BBGM","metrics":{"matching accuracy":"0.8411"},"paper_url":"https://arxiv.org/abs/2311.08141v2","paper_title":"GMTR: Graph Matching Transformers","paper_date":"2023-11-14","code_links":[{"title":"jp-guo/gm-transformer","url":"https://github.com/jp-guo/gm-transformer"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54527,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"GMTR","metrics":{"matching accuracy":"0.836"},"paper_url":"https://arxiv.org/abs/2311.08141v2","paper_title":"GMTR: Graph Matching Transformers","paper_date":"2023-11-14","code_links":[{"title":"jp-guo/gm-transformer","url":"https://github.com/jp-guo/gm-transformer"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54528,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"COMMON","metrics":{"matching accuracy":"0.8267"},"paper_url":"https://arxiv.org/abs/2212.04085v3","paper_title":"Graph Matching with Bi-level Noisy Correspondence","paper_date":"2022-12-08","code_links":[{"title":"Thinklab-SJTU/ThinkMatch","url":"https://github.com/Thinklab-SJTU/ThinkMatch"},{"title":"Lin-Yijie/Graph-Matching-Networks","url":"https://github.com/Lin-Yijie/Graph-Matching-Networks/tree/main/COMMON"},{"title":"xlearning-scu/2023-iccv-common","url":"https://github.com/xlearning-scu/2023-iccv-common"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54529,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"GCAN","metrics":{"matching accuracy":"0.8223"},"paper_url":"http://openaccess.thecvf.com//content/CVPR2022/html/Jiang_Graph-Context_Attention_Networks_for_Size-Varied_Deep_Graph_Matching_CVPR_2022_paper.html","paper_title":"Graph-Context Attention Networks for Size-Varied Deep Graph Matching","paper_date":"2022-01-01","code_links":[{"title":"zhehengjiang/gcan","url":"https://github.com/zhehengjiang/gcan"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54530,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"CREAM","metrics":{"matching accuracy":"0.814"},"paper_url":"https://ieeexplore.ieee.org/document/10477322","paper_title":"Cross-modal Retrieval with Noisy Correspondence via Consistency Refining and Mining","paper_date":"2024-03-25","code_links":[{"title":"XLearning-SCU/2024-TIP-CREAM","url":"https://github.com/XLearning-SCU/2024-TIP-CREAM"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54531,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"ASAR-GM","metrics":{"matching accuracy":"0.8115"},"paper_url":"http://openaccess.thecvf.com//content/CVPR2022/html/Ren_Appearance_and_Structure_Aware_Robust_Deep_Visual_Graph_Matching_Attack_CVPR_2022_paper.html","paper_title":"Appearance and Structure Aware Robust Deep Visual Graph Matching: Attack, Defense and Beyond","paper_date":"2022-01-01","code_links":[{"title":"thinklab-sjtu/robustmatch","url":"https://github.com/thinklab-sjtu/robustmatch"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54532,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"GAMnet","metrics":{"matching accuracy":"0.807"},"paper_url":"https://dl.acm.org/doi/abs/10.1145/3474085.3475669","paper_title":"GAMnet: Robust Feature Matching via Graph Adversarial-Matching Network","paper_date":"2021-10-17","code_links":[],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54533,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"NHGM-v2","metrics":{"matching accuracy":"0.8040"},"paper_url":"https://arxiv.org/abs/1911.11308v3","paper_title":"Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matching","paper_date":"2019-11-26","code_links":[{"title":"Thinklab-SJTU/ThinkMatch","url":"https://github.com/Thinklab-SJTU/ThinkMatch"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54534,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"EAGM","metrics":{"matching accuracy":"0.705"},"paper_url":"https://www.ijcai.org/proceedings/2021/134","paper_title":"Adaptive Edge Attention for Graph Matching with Outliers","paper_date":"2021-08-19","code_links":[{"title":"bestwei/eagm","url":"https://github.com/bestwei/eagm"},{"title":"JingweiQu/EAGM","url":"https://github.com/JingweiQu/EAGM"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54535,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"qc-DGM2","metrics":{"matching accuracy":"0.703"},"paper_url":"https://arxiv.org/abs/2103.06643v2","paper_title":"Deep Graph Matching under Quadratic Constraint","paper_date":"2021-03-11","code_links":[{"title":"Zerg-Overmind/QC-DGM","url":"https://github.com/Zerg-Overmind/QC-DGM"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54536,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"qc-DGM1","metrics":{"matching accuracy":"0.693"},"paper_url":"https://arxiv.org/abs/2103.06643v2","paper_title":"Deep Graph Matching under Quadratic Constraint","paper_date":"2021-03-11","code_links":[{"title":"Zerg-Overmind/QC-DGM","url":"https://github.com/Zerg-Overmind/QC-DGM"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54537,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"HNN-HM","metrics":{"matching accuracy":"0.680"},"paper_url":"http://openaccess.thecvf.com//content/ICCV2021/html/Liao_Hypergraph_Neural_Networks_for_Hypergraph_Matching_ICCV_2021_paper.html","paper_title":"Hypergraph Neural Networks for Hypergraph Matching","paper_date":"2021-01-01","code_links":[{"title":"xwliao/hnn-hm","url":"https://github.com/xwliao/hnn-hm"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54538,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"IPCA-GM","metrics":{"matching accuracy":"0.6770"},"paper_url":"https://ieeexplore.ieee.org/abstract/document/9128045","paper_title":"Combinatorial Learning of Robust Deep Graph Matching: an Embedding based Approach.","paper_date":"2020-06-29","code_links":[{"title":"Thinklab-SJTU/ThinkMatch","url":"https://github.com/Thinklab-SJTU/ThinkMatch"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54539,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"CIE-H","metrics":{"matching accuracy":"0.6756"},"paper_url":"https://openreview.net/forum?id=rJgBd2NYPH","paper_title":"Learning deep graph matching with channel-independent embedding and Hungarian attention","paper_date":"2020-01-01","code_links":[],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54540,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"GLMNet","metrics":{"matching accuracy":"0.675"},"paper_url":"https://arxiv.org/abs/1911.07681v1","paper_title":"GLMNet: Graph Learning-Matching Networks for Feature Matching","paper_date":"2019-11-18","code_links":[],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54541,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"IA-GM","metrics":{"matching accuracy":"0.6658"},"paper_url":"https://ojs.aaai.org/index.php/AAAI/article/view/16461","paper_title":"IA-GM: A Deep Bidirectional Learning Method for Graph Matching","paper_date":"2021-05-18","code_links":[],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54542,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"NHGM","metrics":{"matching accuracy":"0.6458"},"paper_url":"https://arxiv.org/abs/1911.11308v3","paper_title":"Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matching","paper_date":"2019-11-26","code_links":[{"title":"Thinklab-SJTU/ThinkMatch","url":"https://github.com/Thinklab-SJTU/ThinkMatch"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54543,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"NGM","metrics":{"matching accuracy":"0.6413"},"paper_url":"https://arxiv.org/abs/1911.11308v3","paper_title":"Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matching","paper_date":"2019-11-26","code_links":[{"title":"Thinklab-SJTU/ThinkMatch","url":"https://github.com/Thinklab-SJTU/ThinkMatch"}],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54544,"task":"Graph Matching","parent_task":null,"dataset":"PASCAL VOC","model_name":"GMN","metrics":{"matching accuracy":"0.6240"},"paper_url":"http://openaccess.thecvf.com/content_cvpr_2018/html/Zanfir_Deep_Learning_of_CVPR_2018_paper.html","paper_title":"Deep Learning of Graph Matching","paper_date":"2018-06-01","code_links":[],"metrics_order":"[\"F1 score\", \"matching accuracy\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}