Adaptive Edge Attention for Graph Matching with Outliers

Graph matching aims at establishing correspondence between node sets of given graphs while keeping the consistency between their edge sets. However, outliers in practical scenarios and equivalent learning of edge representations in deep learning methods are still challenging. To address these issues, we present an Edge Attention-adaptive Graph Matching (EAGM) network and a novel description of edge features. EAGM transforms the matching relation between two graphs into a node and edge classification problem over their assignment graph. To explore the potential of edges, EAGM learns edge attention on the assignment graph to 1) reveal the impact of each edge on graph matching, as well as 2) adjust the learning of edge representations adaptively. To alleviate issues caused by the outliers, we describe an edge by aggregating the semantic information over the space spanned by the edge. Such rich information provides clear distinctions between different edges (e.g., inlier-inlier edges vs. inlier-outlier edges), which further distinguishes outliers in the view of their associated edges. Extensive experiments demonstrate that EAGM achieves promising matching quality compared with state-of-thearts, on cases both with and without outliers. Our source code along with the experiments is available at

PDF Abstract


Results from the Paper

Ranked #7 on Graph Matching on PASCAL VOC (matching accuracy metric)

     Get a GitHub badge
Task Dataset Model Metric Name Metric Value Global Rank Benchmark
Graph Matching PASCAL VOC EAGM matching accuracy 0.705 # 7
Graph Matching Willow Object Class EAGM matching accuracy 0.965 # 11


No methods listed for this paper. Add relevant methods here