Labeled point pattern matching by Delaunay triangulation and maximal cliques
Pattern Recognition
Congruence, similarity and symmetries of geometric objects
Discrete & Computational Geometry - ACM Symposium on Computational Geometry, Waterloo
Combinatorial and experimental results for randomized point matching algorithms
Proceedings of the twelfth annual symposium on Computational geometry
Matching 2D patterns of protein spots
Proceedings of the fourteenth annual symposium on Computational geometry
Pattern Matching for Spatial Point Sets
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Local Similarity Based Point-Pattern Matching
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Pairwise matching of spots in 2-DE images using hopfield network
MDAI'05 Proceedings of the Second international conference on Modeling Decisions for Artificial Intelligence
Hi-index | 0.00 |
In this paper, we study pattern matching of points under non-uniform distortions. First we give a natural definition for the problem. Next we present a simple polynomial time algorithm for the one-dimensional case of the problem, whereas we prove that it is NP-hard in two (or more) dimensions. Then we present a practical heuristic algorithm for finding a matching between two sets of spots obtained by the two-dimensional gel electrophoresis technique, which is a special but important case of the problem.