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
Testing approximate symmetry in the plane is NP-hard
MFCS '89 Selected papers of the symposium on Mathematical foundations of computer science
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
Low distortion maps between point sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The complexity of low-distortion embeddings between point sets
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Graphical Models and Point Pattern Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Improved algorithms for optimal embeddings
ACM Transactions on Algorithms (TALG)
An adaptive fuzzy-inference-rule-based flexible model for automatic elastic image registration
IEEE Transactions on Fuzzy Systems
Efficient colored point set matching under noise
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Autonomous sub-image matching for two-dimensional electrophoresis gels using MaxRST algorithm
Image and Vision Computing
Noisy colored point set matching
Discrete Applied Mathematics
Low Distortion Maps Between Point Sets
SIAM Journal on Computing
Fast matching of large point sets under occlusions
Pattern Recognition
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Approximating the problem, not the solution: an alternative view of point set matching
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Fuzzy similarity measure and fractional image query for large scale protein 2d gel electrophoresis
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
An efficient approximation algorithm for point pattern matching under noise
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
This paper discusses the pattern matching problem for points under non-uniform distortions, which arises from the analysis of two-dimensional (2-D) electrophoresis images. First, we provide a formal definition of the problem. Next, we prove that it is NP-hard in two (or more) dimensions. This proof is based on a reduction from planar 3SAT. Then we present a simple polynomial time algorithm for a special and one-dimensional case of the problem, which is based on dynamic programming. We also present a practical heuristic algorithm for identifying a match between two sets of spots in 2-D gel electrophoresis images obtained from genomic DNA.