The Community for Technology Leaders
Green Image
Issue No. 06 - June (2009 vol. 31)
ISSN: 0162-8828
pp: 1048-1058
Tibério S. Caetano , NICTA and Australian National University, Australia
Julian J. McAuley , NICTA and Australian National University, Australia
Li Cheng , TTI-Chicago, Chicago
Quoc V. Le , Stanford University, Stanford
Alex J. Smola , Yahioo! Research, Santa Clara
As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the 'labels' are matches between them. Our experimental results reveal that learning can substantially improve the performance of standard graph matching algorithms. In particular, we find that simple linear assignment with such a learning scheme outperforms Graduated Assignment with bistochastic normalisation, a state-of-the-art quadratic assignment relaxation algorithm.
Graph matching, Learning, Support Vector Machines, Structured Estimation, Optimization

J. J. McAuley, A. J. Smola, L. Cheng, Q. V. Le and T. S. Caetano, "Learning Graph Matching," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 31, no. , pp. 1048-1058, 2009.
97 ms
(Ver 3.3 (11022016))