Graph rigidity, cyclic belief propagation, and point pattern matching
A recent paper  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]
|Collections||ANU Research Publications|
|Source:||IEEE Transactions on Pattern Analysis and Machine Intelligence|
|01_McAuley_Graph_rigidity,_cyclic_belief_2008.pdf||1.68 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.