Skip navigation
Skip navigation

Learning graph matching

Caetano, Tiberio; McAuley, Julian; Cheng, Li; Le, Quoc Viet; Smola, Alexander

Description

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]

CollectionsANU Research Publications
Date published: 2009
Type: Journal article
URI: http://hdl.handle.net/1885/56769
Source: IEEE Transactions on Pattern Analysis and Machine Intelligence
DOI: 10.1109/TPAMI.2009.28

Download

File Description SizeFormat Image
01_Caetano_Learning_graph_matchin_2009.pdf2.58 MBAdobe PDF    Request a copy
02_Caetano_Learning_graph_matchin_2009.pdf119.65 kBAdobe PDF    Request a copy
03_Caetano_Learning_graph_matchin_2009.pdf90.52 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator