Skip navigation
Skip navigation

Graph rigidity, cyclic belief propagation, and point pattern matching

McAuley, Julian; Caetano, Tiberio; Barbosa, Marconi


A recent paper [1] proposed a provably optimal, polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal graphical model. Its fundamental result is that the chordal graph in question is shown to be globally rigid, implying that exact inference provides the same matching solution as exact inference in a complete graphical model. This implies that the algorithm is optimal when there is no noise in the point patterns. In...[Show more]

CollectionsANU Research Publications
Date published: 2008
Type: Journal article
Source: IEEE Transactions on Pattern Analysis and Machine Intelligence
DOI: 10.1109/TPAMI.2008.124


File Description SizeFormat Image
01_McAuley_Graph_rigidity,_cyclic_belief_2008.pdf1.68 MBAdobe PDF    Request a copy

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

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator