Congruence, similarity and symmetries of geometric objects
Discrete & Computational Geometry - ACM Symposium on Computational Geometry, Waterloo
RAPID: randomized pharmacophore identification for drug design
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximate Geometric Pattern Matching Under Rigid Motions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multidimensional binary search trees used for associative searching
Communications of the ACM
Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Point matching under non-uniform distortions
Discrete Applied Mathematics - Special issue: Computational molecular biology series issue IV
Multiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision
Representation and Detection of Deformable Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Graphical Models and Point Pattern Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Rigidity, Cyclic Belief Propagation, and Point Pattern Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Operations preserving the global rigidity of graphs and frameworks in the plane
Computational Geometry: Theory and Applications
The generalized distributive law
IEEE Transactions on Information Theory
A sparse nonnegative matrix factorization technique for graph matching problems
Pattern Recognition
| Hi-index | 0.01 |
The problem of isometric point-pattern matching can be modeled as inference in small tree-width graphical models whose embeddings in the plane are said to be 'globally rigid'. Although such graphical models lead to efficient and exact solutions, they cannot generally handle occlusions, as even a single missing point may 'break' the rigidity of the graph in question. In addition, such models can efficiently handle point sets of only moderate size. In this paper, we propose a new graphical model that is not only adapted to handle occlusions but is much faster than previous approaches for solving the isometric point-pattern matching problem. We can match point-patterns with thousands of points in a few seconds.