Skip navigation
Skip navigation

Graphical models for graph matching: Approximate models and optimal algorithms

Caelli, Terry; Caetano, Tiberio

Description

Comparing scene, pattern or object models to structures in images or determining the correspondence between two point sets are examples of attributed graph matching. In this paper we show how such problems can be posed as one of inference over hidden Markov random fields. We review some well known inference methods studied over past decades and show how the Junction Tree framework from Graphical Models leads to algorithms that outperform traditional relaxation-based ones.

CollectionsANU Research Publications
Date published: 2005
Type: Journal article
URI: http://hdl.handle.net/1885/82635
Source: Pattern Recognition Letters
DOI: 10.1016/j.patrec.2004.10.022

Download

File Description SizeFormat Image
01_Caelli_Graphical_models_for_graph_2005.pdf310.53 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