Adaptively Transforming Graph Matching

@article{Wang2018AdaptivelyTG,
  title={Adaptively Transforming Graph Matching},
  author={Fudong Wang and Nan Xue and Yipeng Zhang and X. Bai and Gui-Song Xia},
  journal={ArXiv},
  year={2018},
  volume={abs/1807.10160}
}
Recently, many graph matching methods that incorporate pairwise constraint and that can be formulated as a quadratic assignment problem (QAP) have been proposed. [...] Key Method With a linear representation map of the transformation, the pairwise edge attributes of graphs are explicitly represented by unary node attributes, which enables us to reduce the space and time complexity significantly.Expand
A Functional Representation for Graph Matching
Dual Calibration Mechanism Based L2, p-Norm for Graph Matching
Image Matching from Handcrafted to Deep Features: A Survey
Graph-Based Method for Anomaly Detection in Functional Brain Network using Variational Autoencoder

References

SHOWING 1-10 OF 42 REFERENCES
Factorized Graph Matching
  • F. Zhou, F. D. L. Torre
  • Mathematics, Computer Science
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2016
An Integer Projected Fixed Point Method for Graph Matching and MAP Inference
Binary Constraint Preserving Graph Matching
Hyper-graph matching via reweighted random walks
Alternating Direction Graph Matching
A Short Survey of Recent Advances in Graph Matching
Learning Graph Matching
A Graduated Assignment Algorithm for Graph Matching
Graph edit distance as a quadratic assignment problem
Discrete hyper-graph matching
...
1
2
3
4
5
...