Graph Matching with Anchor Nodes: A Learning Approach

CVPR 2013 • Nan Hu • Raif M. Rustamov • Leonidas Guibas

In this paper, we consider the weighted graph matching problem with partially disclosed correspondences between a number of anchor nodes. Our construction exploits recently introduced node signatures based on graph Laplacians, namely the Laplacian family signature (LFS) on the nodes, and the pairwise heat kernel map on the edges... (read more)

PDF Abstract CVPR 2013 PDF CVPR 2013 Abstract

Code
Add Remove Mark official

No code implementations yet. Submit your code now

Tasks
Add Remove

Datasets

  Add Datasets introduced or used in this paper

Results from the Paper
Add Remove

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper
Add Remove

METHOD TYPE
🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet
Contact us on: hello@paperswithcode.com. Papers With Code is a free resource with all data licensed under CC-BY-SA.
Terms Privacy Cookies policy