Caetano, Tiberio; McAuley, Julian; Cheng, Li; Le, Quoc Viet; Smola, Alexander
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...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.