Junction Tree Algorithm
Mostrando 1-1 de 1 artigos, teses e dissertações.
-
1. Graphical models and point pattern matching
This 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 match
Publicado em: 2011