Local Similarity Based Point-Pattern Matching

Authors:
Veli Mäkinen;Esko Ukkonen
Affiliations:
-;-
Venue:
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Year:
2002

Citing 6
Cited 2

An efficient cost scaling algorithm for the assignment problem

Mathematical Programming: Series A and B
An efficient algorithm for image segmentation, Markov random fields and related problems

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Image Warping with Scattered Data Interpolation

IEEE Computer Graphics and Applications
Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions

CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Approximate point set pattern matching with Lp-norm

SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
One-dimensional approximate point set pattern matching with Lp-norm

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study local similarity based distance measures for point-patterns. Such measures can be used for matching point-patterns under non-uniform transformations -- a problem that naturally arises in image comparison problems. A general framework for the matching problem is introduced. We show that some of the most obvious instances of this framework lead to NP-hard optimization problems and are not approximable within any constant factor. We also give a relaxation of the framework that is solvable in polynomial time and works well in practice in our experiments with two-dimensional protein electrophoresis gel images.