GLMNet: Graph Learning-Matching Networks for Feature Matching
Bo Jiang, Pengfei Sun, Jin Tang, Bin Luo

TL;DR
GLMNet introduces an adaptive graph learning approach combined with a Laplacian sharpening convolution to improve feature matching accuracy in graph matching tasks, outperforming existing methods.
Contribution
It proposes a novel graph learning-matching network that adaptively learns optimal graphs and enhances node embeddings for better matching performance.
Findings
Effective on benchmark datasets
Outperforms existing graph matching methods
Laplacian sharpening improves node discriminability
Abstract
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 unified end-to-end model. One important aspect of graph matching is the construction of two matching graphs. However, the matching graphs we feed to existing graph convolutional matching networks are generally fixed and independent of graph matching, which thus are not guaranteed to be optimal for the graph matching task. Also, existing GCN matching method employs several general smoothing-based graph convolutional layers to generate graph node embeddings, in which extensive smoothing convolution operation may dilute the desired discriminatory information of graph nodes. To overcome these issues, we propose a novel Graph Learning-Matching Network (GLMNet) for graph…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Graph Theory and Algorithms · Network Packet Processing and Optimization
MethodsGraph Convolutional Networks · Convolution · Graph Convolutional Network
