Graphical Models and Point Pattern Matching
Open Access
- 21 August 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 28 (10), 1646-1663
- https://doi.org/10.1109/tpami.2006.207
Abstract
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 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 sizesThis publication has 52 references indexed in Scilit:
- Graphical models for graph matching: Approximate models and optimal algorithmsPattern Recognition Letters, 2005
- Graph edit distance from spectral seriationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITIONInternational Journal of Pattern Recognition and Artificial Intelligence, 2004
- Spectral correspondence for point pattern matchingPattern Recognition, 2003
- A new algorithm for non-rigid point matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Structural pattern recognition using genetic algorithmsPattern Recognition, 2002
- Bayesian graph edit distanceIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- The CCD stellar sensor of the MASCO telescope pointing systemAdvances in Space Research, 2000
- Replicator Equations, Maximal Cliques, and Graph IsomorphismNeural Computation, 1999
- Matching hierarchical structures using association graphsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1999