Adaptive Edge Attention for Graph Matching with Outliers

瞿经纬¹ 凌海滨² 张晨睿¹ 吕肖庆¹ 汤帜^1∗
¹北京大学 ²纽约州立大学石溪分校
[PDF] [Code]

Abstract

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-the-arts, on cases both with and without outliers.

Architecture of EAGM

Edge Semantic Feature

Dataset

Quantitative Results

Comparison of matching accuracy (%) on Pascal VOC. Numbers in red indicate the best performance.

Comparison of matching accuracy (%) on CMU House: (a) sampling gap, (b) outlier.

Reference


								@inproceedings{qu2021adaptive, 

									        title={Adaptive Edge Attention for Graph Matching with Outliers},

									        author={Qu, Jingwei and Ling, Haibin and Zhang, Chenrui and Lyu, Xiaoqing and Tang, Zhi},

									        booktitle={Proceedings of the International Joint Conference on Artificial Intelligence},

									        pages={966--972},

									        year={2021},

									        publisher={IJCAI},

									        doi={10.24963/ijcai.2021/134}

								}