Graph Rigidity, Cyclic Belief Propagation, and Point Pattern Matching

A recent paper (Caetano et al., 2006) 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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on pattern analysis and machine intelligence 2008-11, Vol.30 (11), p.2047-2054
Hauptverfasser:	McAuley, J.J., Caetano, T.S., Barbosa, M.S.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Artificial Intelligence Belief propagation chordal graphs Computational complexity Computer science control theory systems Exact sciences and technology global rigidity graph matching Graphical models Graphs Image Enhancement - methods Image Interpretation, Computer-Assisted - methods Inference Inference algorithms Information Storage and Retrieval - methods Matching Mathematical models Noise Noise reduction Optimization Pattern matching Pattern recognition Pattern Recognition, Automated - methods Point pattern matching Polynomials Rendering Rendering (computer graphics) Studies Subtraction Technique Tree graphs
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!