Model-based image matching using location
Model-based image matching using location
Recognizing solid objects by alignment with an image
International Journal of Computer Vision
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Approximate decision algorithms for point set congruence
Computational Geometry: Theory and Applications
Geometric pattern matching under Euclidean motion
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Getting around a lower bound for the minimum Hausdorff distance
Computational Geometry: Theory and Applications
Approximate Geometric Pattern Matching Under Rigid Motions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Pattern Matching for Spatial Point Sets
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
On Approximating the Depth and Related Problems
SIAM Journal on Computing
Hi-index | 0.89 |
We consider the following geometric pattern matching problem: Given two sets of points in the plane, P and Q, and some (arbitrary) @d0, find a similarity transformation T (translation, rotation and scale) such that h(T(P),Q)0 controls the approximation. Our approximation is on the size of the subset, B@?P, such that h(T(B),Q)(1-@e)|P| with high probability.