Local similarity based point-pattern matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2373, Issue , 2002, Pages 115-132

  Mäkinen, Veli ^a   Ukkonen, Esko ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTROPHORESIS; POLYNOMIAL APPROXIMATION;

CONSTANT FACTORS; DISTANCE MEASURE; IMAGE COMPARISON; LOCAL SIMILARITY; MATCHING PROBLEMS; OPTIMIZATION PROBLEMS; POINT PATTERN MATCHING; PROTEIN ELECTROPHORESIS;

PATTERN MATCHING;

EID: 84937433378     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45452-7_11     Document Type: Conference Paper

References (12)

1. T. Akutsu, K. Kanaya, A. Ohyama, and A. Fujiyama. Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions. In Proc. 10th Annual Symposium on Combinatorial Pattern Matching (CPM’99), LNCS 1645, pp. 212–222, 1999.
2. H. Alt and L. Guibas. Discrete Geometric Shapes: Matching, Interpolation, and Approximation, In J.-R. Sack, J. Urrutia, editors, Handbook of Computational Geometry, pp. 121–153. Elsevier Science Publishers B. V. North-Holland, Amsterdam, 1999.
3. R. D. Appel, J. R. Vargas, P. M. Palagi, D. Walther, and D. F. Hochstrasser. Melanie II - A Third Generation Software Package for Analysis of Two-dimensional Electrophoresis Images: II. Algorithms. J. Electrophoresis 18, pp. 2735–2748, 1997.
4. T. Eiter and H. Mannila. Distance Measures for Point Sets and Their Computation. Acta Informatica, 34(2):109–133, 1997.
5. M. R. Garey, D. S. Johnson. Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco, 1979.
6. A. V. Goldberg and R. Kennedy. An Efficient Cost Scaling Algorithm for the Assignment Problem. Mathematical Programming, Vol. 71, pp. 153–178, 1995.
7. D. S. Hochbaum. An Efficient Algorithm for Image Segmentation, Markov Random Fields and Related Problems. Journal of the ACM, Vol. 48, No. 4, pp. 686–701, 2001.
8. S. Jokisch and H. Müller. Inter-Point-Distance-Dependent Approximate Point Set Matching. Research Report No. 653, University of Dortmund, Department of Computer Science, July 1997.
9. J. Kleinberg and E. Tardos. Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. In Proc. 40th Annual IEEE Symposium on the Foundations of Computer Science (FOCS’99), pp. 14–23, 1999.
10. V. Mäkinen. Using Edit Distance in Point-Pattern Matching. In Proc. 8th Workshop on String Processing and Information Retrieval (SPIRE 2001), IEEE CS Press, pp. 153–161, 2001.
11. M. Queyranne. Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems. Oper. Res. Lett., 4, pp. 232–234, 1986.
12. D. Ruprecht and H. Müller. Image Warping with Scattered Data Interpolation. IEEE Computer Graphics and Applications, Vol. 3, pp. 37–43, 1995.