An efficient approximation algorithm for point pattern matching under noise

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

Volumn 3887 LNCS, Issue , 2006, Pages 298-310

  Choi, Vicky ^a   Goyal, Navin ^b  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING; SPURIOUS SIGNAL NOISE;

APPROXIMATION ALGORITHM; HAUSDORFF DISTANCE; POINT PATTERN MATCHING PROBLEMS; STRUCTURAL BIOINFORMATICS;

PATTERN MATCHING;

EID: 33745590125     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11682462_30     Document Type: Conference Paper

References (29)

1. Ajtai, M., Megiddo, N.: A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimension. Proc. 24th ACM Symp. on Theory of Computing (1992) 327-338
2. Alon, N., Spencer, J.: The Probabilistic Method. Wiley-Interscience 2000
3. Akutsu, T.: Protein Structure Alignment Using Dynamic Programming and Iterative Improvement. IEICE Trans. on Information and Systems, 12 (1996) 1629-1636
4. Akutsu, T., Tamaki, H., Tokuyama, T.: Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. Discrete & Computational Geometry, 20(3) (1998) 307-331
5. Akutsu, T., Kanaya, K., Ohyama A., Fujiyama, A.: Point matching under non-uniform distortions. Discrete Applied Mathematics, 127(1) (2003) 5-21
6. Alt, H., Guibas, L.J.: Discrete Geometric Shapes: Matching, Interpolation, and Approximation. In: Sack, J.-R., Urrutia J. (eds): Handbook of Computational Geometry, Elsevier Science Publishers B.V. North-Holland Amsterdam (1999) 121-153
7. Alt, H., Mehlhorn, K., Wagener, H., Welzl, E.: Congruence, Similarity, and Symmetries of Geometric Objects. Discrete & Computational Geometry, 3 (1988) 237-256
8. Ambühl, C., Chakraborty, S., Gärtner, B.: Computing Largest Common Point Sets under Approximate Congruence. ESA 2000, Lecture Notes in Computer Science Vol. 1879, Springer-Verlag, (2000) 52-63
9. Biswas, S., Chakraborty, S.; Fast Algorithms for Determining Protein Structure Similarity. Workshop on Bioinformatics and Computational Biology, Hyderabad, India, (2001)
10. Chakraborty, S., Biswas, S.: Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules. Workshop on Algorithms and Data Structures (WADS) 1999. Lecture Notes in Computer Science, Vol. 1663. Springer-Verlag (1999)
11. Cardoze, D., Schulman, L.: Pattern Matching for Spatial Point Sets. Proc. 39th Annual IEEE Symp. on Foundations of Computer Science (1998) 156-165
12. Chew, L.P., Dor, D., Efrat, A., Kedem, K.: Geometric Pattern Matching in d-Dimensional Space, Discrete and Computational Geometry, 21 (1999) 257-274
13. Choi, V., Goyal, N.: A Combinatorial Shape Matching Algorithm for Rigid Protein Docking. Combinatorial Pattern Matching (CPM) 2004, Lecture Notes in Computer Science, Vol. 3109, Springer (2004) 285-296
14. Finn, P., Kavraki, L., Latombe, J-C., Motwani, R., Shelton, C., Venkatasubramanian, S., Yao, A.: RAPID: Randomized Pharmacophore Identification in Drug Design The 13th Symposium on Computational Geometry, 1997. Computational Geometry: Theory and Applications 10 (4), (1998)
15. Gavrilov, M., Indyk, P., Motwani, R., Venkatasubramanian, S.: Combinatorial and Experimental Methods for Approximate Point Pattern Matching. Algorithmica 38(1) (2003) 59-90
16. Goodrich, M.T., Mitchell, J.S.B., Orletsky, M.W.: Approximate Geometric Pattern Matching Under Rigid Motions. IEEE Trans. Pattern Anal. Mach. Intell. 21(4) (1999) 371-379
17. Grimson, W.E.L, Huttenlocher, D.P.: On the Sensitivity of Geometric Hashing. Proc. of the 3rd Int'l Conference on Computer Vision, (1990) 334-338
18. Grimson, W.E.L., Huttenlocher, D.P.: On the Sensitivity of Hough Transform for Object Recognition. IEEE Trans. on Pattern Analysis and Machine Intell. 12(3) (1990)
19. Hecker, Y., Bolle, R.: On Geometric Hashing and the Generalized Hough Transform. IEEE Trans. on Systems, Man and Cybernetics, 24 (1994) 1328-1338
20. Heffernan, P.J., Schirra, S.: Approximate Decision Algorithms for Point Set Congruence. Comput. Geom. 4 (1994) 137-156
21. Indyk, P., Motwani, R., Venkatasubramanian, S.: Geometric Matching under Noise: Combinatorial Bounds and Algorithms. The 10th ACM-SIAM Symp. on Discrete Algorithms (1999)
22. Irani, S., Raghavan, P.: Combinatorial and Experimental Results for Randomized Point Matching Algorithms. The 12th Symposium on Computational Geometry, 1996. Comput. Geom. 12(1-2) (1999) 17-31
23. Katz, M., Sharir, M.: An Expander-based Approach to Geometric Optimization. SIAM J. Comput., 26(5) 1997 1384-1408
24. Kenyon, C., Rabani, Y., Sinclair, A.: Low Distortion Maps Between Point Sets. Proc. of the 36th Annual ACM Symp. on Theory of Computing (2004)
25. Krivelevich, M., Sudakov, B.: Pseudo-random Graphs. Preprint. Available at http://www.math.tau.ac.il/~krivelev/papers.html
26. Lamdan, Y., Wolfson, H.J.: Geometric Hashing: A General and Efficient Model-based Recognition Scheme. The 2nd Int'l Conference on Computer Vision (1988) 238-249
27. Oison, CF.: Efficient Pose Clustering Using a Randomized Algorithm. Int'l J. of Computer Vision, 23(2) (1997) 131-147
28. Wolfson, H.J., Rigoutsos, I.: Geometric Hashing: an Overview. IEEE Comput. Science and Engineering, 4 (1997) 10-21
29. Nussinov, R., Wolfson, H.J.: Efficient Detection of Three - Dimensional Motifs In Biological Macromolecules by Computer Vision Techniques, Proc. of the Nat'l Academy of Sciences, 88 (1991) 10495-10499