There are 8 repositories under graph-matching topic.
A research protocol for deep graph matching.
A Python Graph Matching Toolkit.
Implementation of "Deep Graph Matching Consensus" in PyTorch
[CVPR' 22 ORAL] SIGMA: Semantic-complete Graph Matching for Domain Adaptative Object Detection
🕸️ Graphs, finite fields and discrete dynamical systems in Kotlin
GMCF: Neural Graph Matching based Collaborative Filtering, SIGIR 2021
Code of the paper "Game theoretic hypergraph matching for multi-source image correspondences". [论文代码] 超图匹配和多源图像特征点匹配。
A platform to facilitate automized inter-hospital kidney transplants.
Automatic time table generation system (IIT Dharwad)
Pytorch implementation of LayoutGMN.
Official Github for "PharmacoNet: Accelerating Large-Scale Virtual Screening by Deep Pharmacophore Modeling" (NeurIPS 2023 Workshop)
Graph matching and clustering by comparing heat kernels via optimal transport.
Reproducing images with mosaics of circle-packed buttons.
Solving the Weighted Bipartite b-Matching (WBbM) problem
Implementation for the CVPR2020 paper "Zero-Assignment Constraint for Graph Matching with Outliers"
A python implementation of Edmonds blossom algorithm for maximum-cardinality matching.
A Python/Cython package for graph edit distances and graph matching
Tools to find the correspondences between vertices in different graphs.
Content based image search using contours of image
A Python implementation of Edmond's blossom algorithm to find maximum matchings in general graphs
A package to match sketch maps onto their ground truths.
:mortar_board: Graph Matching Algorithm
Compressed Sensing project - ENSAE ParisTech
Dual decomposition solvers for the quadratic assignment problem (QAP), also called graph matching in computer vision based on the LP_MP library.
Inner Distance Shape Context (IDSC) & Spectral Matching for Line-art Colorization.
Algorithms for solving the quadratic assignment problem (QAP) implemented in Julia.
This repository contains famous graph algorithms implementation and solution of different graph problems
Rematch: Robust and Efficient Matching of Local Knowledge Graphs for Improved Structural and Semantic Similarity