Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem With Extension to Hypergraph and Multiple-Graph Matching

Graph matching involves combinatorial optimization based on edge-to-edge affinity matrix, which can be generally formulated as Lawler's quadratic assignment problem (QAP). This paper presents a QAP network directly learning with the affinity matrix (equivalently the association graph) whereby t...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on pattern analysis and machine intelligence 2022-09, Vol.44 (9), p.5261-5279
Main Authors: Wang, Runzhong, Yan, Junchi, Yang, Xiaokang
Format: Article
Language:English
Subjects:
Affinity
Assignment problem
Classification
Combinatorial analysis
combinatorial optimization
Constraints
deep learning
Embedding
Feature extraction
Graph matching
graph neural networks
Graph theory
Graphs
Learning
Measurement
Operations research
Optimization
Pattern matching
Peer-to-peer computing
quadratic assignment problem
Splines (mathematics)
Tensors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!