Graph matching plays a central role in such fields as computer vision, pattern recognition, and bioinformatics. Graph matching problems can be cast as two types of quadratic assignment problems (QAPs): Koopmans-Beckmann's QAP or Lawler's QAP. In our paper, we provide a unifying view for these two problems by introducing new rules for array operations in Hilbert spaces. Consequently, Lawler's QAP can be considered as the Koopmans-Beckmann's alignment between two arrays in reproducing kernel Hilbert spaces (RKHS), making it possible to efficiently solve the problem without computing a huge affinity matrix. Furthermore, we develop the entropy-regularized Frank-Wolfe (EnFW) algorithm for optimizing QAPs, which has the same convergence rate as the original FW algorithm while dramatically reducing the computational burden for each outer iteration. We conduct extensive experiments to evaluate our approach, and show that our algorithm significantly outperforms the state-of-the-art in both matching accuracy and scalability.
Zhen Zhang (WASHINGTON UNIVERSITY IN ST.LOUIS)
Yijian Xiang (Washington University in St. Louis)
Teddy Wu (IBM Research AI)
Lingfei Wu is a Research Staff Member in the IBM AI Foundations Labs, Reasoning group at IBM T. J. Watson Research Center. He earned his Ph.D. degree in computer science from College of William and Mary in August 2016, under the supervision of Prof. Andreas Stathopoulos. His research interests mainly span in Machine Learning, Deep Learning, Representation Learning, Natural Language Processing, and Numerical Linear Algebra.
Bing Xue (Washington University in St. Louis)
Arye Nehorai (WASHINGTON UNIVERSITY IN ST.LOUIS)
Related Events (a corresponding poster, oral, or spotlight)
2019 Poster: KerGM: Kernelized Graph Matching »
Thu Dec 12th 05:00 -- 07:00 PM Room East Exhibition Hall B + C
More from the Same Authors
2018 Poster: RetGK: Graph Kernels based on Return Probabilities of Random Walks »
Zhen Zhang · Mianzhi Wang · Yijian Xiang · Yan Huang · Arye Nehorai