A fast expected time algorithm for the 2-D point pattern matching problem
- 31 August 2004
- journal article
- Published by Elsevier BV in Pattern Recognition
- Vol. 37 (8), 1699-1711
- https://doi.org/10.1016/j.patcog.2003.12.009
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Faster point set pattern matching in 3-DPattern Recognition Letters, 1998
- Scaling Universalities ofkth-Nearest Neighbor Distances on Closed ManifoldsAdvances in Applied Mathematics, 1998
- Fast algorithm for point pattern matching: Invariant to translations, rotations and scale changesPattern Recognition, 1997
- Combinatorial and experimental results for randomized point matching algorithmsPublished by Association for Computing Machinery (ACM) ,1996
- Algorithms for proximity problems in higher dimensionsComputational Geometry, 1996
- Point matching using asymmetric neural networksPattern Recognition, 1993
- Recognizing solid objects by alignment with an imageInternational Journal of Computer Vision, 1990
- Labeled point pattern matching by fuzzy relaxationPattern Recognition, 1984
- Point pattern matching by relaxationPattern Recognition, 1980
- Some inequalities relating to the partial sum of binomial probabilitiesAnnals of the Institute of Statistical Mathematics, 1959