Skip navigation
Skip navigation

Faster graphical models for point-pattern matching

Caetano, Tiberio; McAuley, Julian


It has been shown that isometric matching problems can be solved exactly in polynomial time, by means of a Junction Tree with small maximal clique size. Recently, an iterative algorithm was presented which converges to the same solution an order of magnitude faster. Here, we build on both of these ideas to produce an algorithm with the same asymptotic running time as the iterative solution, but which requires only a single iteration of belief propagation. Thus our algorithm is much faster in...[Show more]

CollectionsANU Research Publications
Date published: 2009
Type: Journal article
Source: Spatial Vision
DOI: 10.1163/156856809789476083


File Description SizeFormat Image
01_Caetano_Faster_graphical_models_for_2009.pdf612.02 kBAdobe PDF    Request a copy
02_Caetano_Faster_graphical_models_for_2009.pdf79.55 kBAdobe PDF    Request a copy
03_Caetano_Faster_graphical_models_for_2009.pdf83.44 kBAdobe PDF    Request a copy

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

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator