Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching

A recent paper \cite{CaeCaeSchBar06} 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. Their fundamental result is that the chordal graph in question is shown to be globally...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	McAuley, Julian J, Caetano, Tiberio S, Barbosa, Marconi S
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computer Vision and Pattern Recognition
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!