Deep Learning of Graph Matching
The problem of graph matching under node and pair-wise constraints is fundamental in areas as diverse as combinatorial optimization, machine learning or computer vision, where representing both the relations between nodes and their neighborhood structure is essential. We present an end-to-end model that makes it possible to learn all parameters of the graph matching process, including the unary and pairwise node neighborhoods, represented as deep feature extraction hierarchies. The challenge is in the formulation of the different matrix computation layers of the model in a way that enables the consistent, efficient propagation of gradients in the complete pipeline from the loss function, through the combinatorial optimization layer solving the matching problem, and the feature extraction hierarchy. Our computer vision experiments and ablation studies on challenging datasets like PASCAL VOC keypoints, Sintel and CUB show that matching models refined end-to-end are superior to counterparts based on feature hierarchies trained for other problems.
Code (0)
등록된 구현이 없습니다.
Tasks
Combinatorial OptimizationDeep LearningGraph MatchingSimilar Papers 제목 키워드 기반
GLMNet: Graph Learning-Matching Networks for Feature Matching
Recently, graph convolutional networks (GCNs) have shown great potential for the task of graph matching. It can integrate graph node feature embedding, node-wise affinity learning and matching optimization together in a …
Graph LearningGraph MatchingTask 2Learning Universe Model for Partial Matching Networks over Multiple Graphs
We consider the general setting for partial matching of two or multiple graphs, in the sense that not necessarily all the nodes in one graph can find their correspondences in another graph and vice versa. We take a unive…
Graph MatchingMetric LearningOutlier DetectionStochastic Iterative Graph Matching
Recent works leveraging Graph Neural Networks to approach graph matching tasks have shown promising results. Recent progress in learning discrete distributions poses new opportunities for learning graph matching models. …
Graph MatchingStochastic OptimizationGAMnet: Robust Feature Matching via Graph Adversarial-Matching Network
Recently, deep graph matching (GM) methods have gained increasing attention. These methods integrate graph nodes¡¯s embedding, node/edges¡¯s affinity learning and final correspondence solver together in an end-to-end man…
Graph MatchingGraph-Context Attention Networks for Size-Varied Deep Graph Matching
Deep learning for graph matching has received growing interest and developed rapidly in the past decade. Although recent deep graph matching methods have shown excellent performance on matching between graphs of equa…
Graph Matching