Learning graph matching
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]
|Collections||ANU Research Publications|
|Source:||IEEE Transactions on Pattern Analysis and Machine Intelligence|
|01_Caetano_Learning_graph_matchin_2009.pdf||2.58 MB||Adobe PDF||Request a copy|
|02_Caetano_Learning_graph_matchin_2009.pdf||119.65 kB||Adobe PDF||Request a copy|
|03_Caetano_Learning_graph_matchin_2009.pdf||90.52 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.