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 pres...
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...