Graphical models and point pattern matching

dc.creatorCaetano, Tiberio Silva
dc.creatorCaelli, Terry
dc.creatorSchuurmans, Dale
dc.creatorBarone, Dante Augusto Couto
dc.date2011-01-29T06:00:36Z
dc.date2006
dc.identifier0162-8828
dc.identifierhttp://hdl.handle.net/10183/27603
dc.identifier000585735
dc.descriptionThis paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We present a noniterative, polynomial time algorithm that is guaranteed to find an optimal solution for the noiseless case. First, we model point pattern matching as a weighted graph matching problem, where weights correspond to Euclidean distances between nodes. We then formulate graph matching as a problem of finding a maximum probability configuration in a graphical model By using graph rigidity arguments, we prove that a sparse graphical model yields equivalent results to the fully connected model in the noiseless case. This allows us to obtain an algorithm that runs in polynomial time and is provably optimal for exact matching between noiseless point sets. For inexact matching, we can still apply the same algorithm to find approximately optimal solutions. Experimental results obtained by our approach show improvements in accuracy over current methods, particularly when matching patterns of different sizes.
dc.formatapplication/pdf
dc.languageeng
dc.relationIEEE transactions on pattern analysis and machine intelligence. New York. Vol. 28, n. 10 (Oct. 2006), p. 1646-1663
dc.rightsOpen Access
dc.subjectPoint pattern matching
dc.subjectGraph matching
dc.subjectGraphical models
dc.subjectMarkov random fields
dc.subjectJunction tree algorithm
dc.subjectComputação gráfica
dc.subjectReconhecimento : Padroes
dc.titleGraphical models and point pattern matching
dc.typeArtigo de periódico
dc.typeEstrangeiro


Este ítem pertenece a la siguiente institución