Reconstructing sets from interpoint distances (extended abstract)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Matching shapes with a reference point
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Point pattern matching algorithm invariant to geometrical transformation and distortion
Pattern Recognition Letters
Tiny families of functions with random properties: a quality-size trade-off for hashing
Proceedings of the workshop on Randomized algorithms and computation
Geometric Hashing: An Overview
IEEE Computational Science & Engineering
Comparing Images Using the Hausdorff Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Earth Mover's Distance under Transformation Sets
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Algorithmic Applications of Low-Distortion Geometric Embeddings
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On the turnpike problem
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Deformation Invariant Image Matching
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
The string edit distance matching problem with moves
ACM Transactions on Algorithms (TALG)
Sizing sketches: a rank-based analysis for similarity search
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Hi-index | 0.00 |
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subject to an unknown translation. We define the distance between any two point sets to be the minimum size of their symmetric difference over all translations of one set relative to the other. We consider the problem in the context of similarity search. We assume that a large database of point sets is to be preprocessed so that given any query point set, the closest matches in the database can be computed efficiently. Our approach is based on showing that there is a randomized algorithm that computes a translation-invariant embedding of any point set of size at most n into the L_1 metric, so that with high probability, distances are subject to a distortion that is O(log2 n).