2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.CV2018
Graph Matching with Anchor Nodes: A Learning Approach
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 introdu…
cs.DS2016★ 1 cited
Distributable Consistent Multi-Object Matching
Nan Hu, Qixing Huang, Boris Thibert +1
In this paper we propose an optimization-based framework to multiple object matching. The framework takes maps computed between pairs of objects as input, and outputs maps that are…
cs.CV2013★ 2 cited
Stable and Informative Spectral Signatures for Graph Matching
Nan Hu, Raif M. Rustamov, Leonidas Guibas
In this paper, we consider the approximate weighted graph matching problem and introduce stable and informative first and second order compatibility terms suitable for inclusion in…