Mostrar registro simples

dc.contributor.authorCaetano, Tiberio Silvapt_BR
dc.contributor.authorCaelli, Terrypt_BR
dc.contributor.authorSchuurmans, Dalept_BR
dc.contributor.authorBarone, Dante Augusto Coutopt_BR
dc.date.accessioned2011-01-29T06:00:36Zpt_BR
dc.date.issued2006pt_BR
dc.identifier.issn0162-8828pt_BR
dc.identifier.urihttp://hdl.handle.net/10183/27603pt_BR
dc.description.abstractThis 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.en
dc.format.mimetypeapplication/pdfpt_BR
dc.language.isoengpt_BR
dc.relation.ispartofIEEE transactions on pattern analysis and machine intelligence. New York. Vol. 28, n. 10 (Oct. 2006), p. 1646-1663pt_BR
dc.rightsOpen Accessen
dc.subjectPoint pattern matchingen
dc.subjectComputação gráficapt_BR
dc.subjectReconhecimento : Padroespt_BR
dc.subjectGraph matchingen
dc.subjectGraphical modelsen
dc.subjectMarkov random fieldsen
dc.subjectJunction tree algorithmen
dc.titleGraphical models and point pattern matchingpt_BR
dc.typeArtigo de periódicopt_BR
dc.identifier.nrb000585735pt_BR
dc.type.originEstrangeiropt_BR


Thumbnail
   

Este item está licenciado na Creative Commons License

Mostrar registro simples