{"task":"Graph Matching","dataset":"Willow Object Class","metric_names":["matching accuracy","F1 score"],"rows":[{"id":54485,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"COMMON","metrics":{"matching accuracy":"0.9910"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54486,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"GANN-MGM","metrics":{"matching accuracy":"0.9906"},"paper_url":"http://proceedings.neurips.cc/paper/2020/hash/e6384711491713d29bc63fc5eeb5ba4f-Abstract.html","paper_title":"Graduated Assignment for Joint Multi-Graph Matching and Clustering with Application to Unsupervised Graph Matching Network Learning","paper_date":"2020-12-01","code_links":[{"title":"Thinklab-SJTU/ThinkMatch","url":"https://github.com/Thinklab-SJTU/ThinkMatch"}],"metrics_order":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54487,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"URL","metrics":{"matching accuracy":"0.989"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54488,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"CREAM","metrics":{"matching accuracy":"0.988"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54489,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"Direct-MGM","metrics":{"matching accuracy":"0.987"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54490,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"GMT-BBGM","metrics":{"matching accuracy":"0.9813"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54491,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"Direct-2HGM","metrics":{"matching accuracy":"0.981"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54492,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"qc-DGM2","metrics":{"matching accuracy":"0.977"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54493,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"NGM-v2","metrics":{"matching accuracy":"0.9754"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54494,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"BBGM","metrics":{"matching accuracy":"0.9718"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54495,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"GCAN","metrics":{"matching accuracy":"0.9700"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54496,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"HNN-HM","metrics":{"matching accuracy":"0.968"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54497,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"GAMnet","metrics":{"matching accuracy":"0.9662"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54498,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"EAGM","metrics":{"matching accuracy":"0.965"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54499,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"qc-DGM1","metrics":{"matching accuracy":"0.960"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54500,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"GLMNet","metrics":{"matching accuracy":"0.924"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54501,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"IPCA-GM","metrics":{"matching accuracy":"0.9006"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54502,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"NGM","metrics":{"matching accuracy":"0.8530"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54503,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"GMN","metrics":{"matching accuracy":"0.7934"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54504,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"GCAN-AFAT-I","metrics":{"F1 score":"0.837"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54505,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"NGMv2-AFAT-I","metrics":{"F1 score":"0.831"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54506,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"GCAN-AFAT-U","metrics":{"F1 score":"0.823"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":54507,"task":"Graph Matching","parent_task":null,"dataset":"Willow Object Class","model_name":"NGMv2-AFAT-U","metrics":{"F1 score":"0.817"},"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":"[\"matching accuracy\", \"F1 score\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}