Structural Stereopsis for 3-D Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Feature-based correspondence: an eigenvector approach
Image and Vision Computing - Special issue: BMVC 1991
A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Matching by Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
RAPID: randomized pharmacophore identification for drug design
Computational Geometry: Theory and Applications - special issue on applied computational geometry
Approximate Geometric Pattern Matching Under Rigid Motions
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Matching Hierarchical Structures Using Association Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Convergence properties of the softassign quadratic assignment algorithm
Neural Computation
Replicator equations, maximal cliques, and graph isomorphism
Neural Computation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multiple view geometry in computer visiond
Multiple view geometry in computer visiond
Efficient Matching and Indexing of Graph Models in Content-Based Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Digital Picture Processing
Journal of Global Optimization
Structural Matching in Computer Vision Using Probabilistic Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A RKHS Interpolator-Based Graph Matching Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph-Based Methods for Vision: A Yorkist Manifesto
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Point matching under non-uniform distortions
Discrete Applied Mathematics - Special issue: Computational molecular biology series issue IV
Stochastic processes on graphs with cycles: geometric and variational approaches
Stochastic processes on graphs with cycles: geometric and variational approaches
An Eigenspace Projection Clustering Method for Inexact Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Graph Edit Distance from Spectral Seriation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graphical models for graph matching: Approximate models and optimal algorithms
Pattern Recognition Letters - Special issue: In memoriam Azriel Rosenfeld
Graphical models for graph matching
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Many-to-many graph matching via metric embedding
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Distance Patterns in Structural Similarity
The Journal of Machine Learning Research
Graph kernels between point clouds
Proceedings of the 25th international conference on Machine learning
Similarity Invariant Delaunay Graph Matching
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Efficient Random Sampling for Nonrigid Feature Matching
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
Structural matching of 2D electrophoresis gels using deformed graphs
Pattern Recognition Letters
Fast matching of large point sets under occlusions
Pattern Recognition
Using diagonals of orthogonal projection matrices for affine invariant contour matching
Image and Vision Computing
Contour-based object detection as dominant set computation
Pattern Recognition
Dense Neighborhoods on Affinity Graph
International Journal of Computer Vision
Registering sets of points using Bayesian regression
Neurocomputing
Graph matching based on spectral embedding with missing value
Pattern Recognition
Geometric graph comparison from an alignment viewpoint
Pattern Recognition
Information Sciences: an International Journal
Robust point matching revisited: a concave optimization approach
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part II
Finding correspondence from multiple images via sparse and low-rank decomposition
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
Rigid and non-rigid shape matching for mechanical components retrieval
CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management
Real-Time exact graph matching with application in human action recognition
HBU'12 Proceedings of the Third international conference on Human Behavior Understanding
Active graph matching based on pairwise probabilities between nodes
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
A sparse nonnegative matrix factorization technique for graph matching problems
Pattern Recognition
Spectra of shape contexts: An application to symbol recognition
Pattern Recognition
| Hi-index | 0.14 |
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 sizes.