Simple algorithms for partial point set pattern matching under rigid motion

Pattern Recognition

Volumn 39, Issue 9, 2006, Pages 1662-1671

  Bishnu, Arijit ^a   Das, Sandip ^b   Nandy, Subhas C ^b   Bhattacharya, Bhargab B ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

^b INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Algorithms; Approximate matching; Complexity; Computational geometry; Fingerprint matching; Point set pattern matching

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DATABASE SYSTEMS; IMAGE ANALYSIS; OBJECT RECOGNITION; QUERY LANGUAGES;

APPROXIMATE MATCHING; COMPLEXITY; FINGERPRINT MATCHING; POINT SET PATTERN MATCHING;

PATTERN MATCHING;

EID: 33745007969     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2006.01.003     Document Type: Article

References (45)

1. H. Alt, L.J. Guibas, Discrete geometric shapes: matching, interpolation, and approximation-a survey, Technical Report B 96-11, Freie Universität Berlin, 1996.
2. Mount D.M., Netanyahu N.S., and Moigne J.L. Efficient algorithms for robust feature matching. Pattern Recognition 32 (1999) 17-38
3. Norel R., Fischer D., Wolfson H., and Nussinov R. Molecular surface recognition by a computervision based technique. Protein Eng. 7 (1994) 39-46
4. H.S. Baird, Model based image matching using location, Distinguished Dissertation Series, MIT Press, Cambridge, MA, 1984.
5. Eric W., and Grimson L. Object Recognition by Computer: The Role of Geometric Constraints (1990), MIT Press, Cambridge, MA
6. Forsyth D., Mundy J.L., Zisserman A., Coelho C., Heller A., and Rothwell C. Invariant descriptors for 3-D object recognition and pose. IEEE Trans. PAMI 13 (1991) 971-991
7. Goodrich M.T., Mitchell J.S.B., and Orletsky M.W. Approximate geometric pattern matching under rigid motions. IEEE Trans. PAMI 21 4 (1999) 371-379
8. Haralick R.M., Lee C.N., Zhuang X., Vaidya V.G., and Kim M.B. Pose estimation from corresponding point data. IEEE Trans. SMC 19 (1989) 1426-1446
9. Huttenlocher D., and Ullman S. Recognizing solid objects by alignment with an image. Int. J. Comput. Vision 5 (1990) 195-212
10. Atallah M.J. A matching problem in the plane. J. Comput. Syst. Sci. 31 (1985) 63-70
11. Atkinson M.D. An optimal algorithm for geometrical congruence. J. Algorithms 8 (1987) 159-172
12. Knuth Jr. D.E., Morris J.H., and Pratt V.R. Fast pattern matching in strings. SIAM J. Comput 6 2 (1977) 240-267
13. Alt H., Mehlhorn K., Wagener H., and Welzl E. Congruence similarity and symmetries of geometric objects. Discrete Comput. Geometry 3 (1988) 237-256
14. Akutsu T. On determining the congruence of point sets in d dimensions. Comput. Geometry Theory Appl. 9 (1998) 247-256
15. Brass P., and Knauer C. Testing the congruence of d-dimensional point sets. Int. J. Comput. Geometry Appl. 12 (2002) 115-124
16. Rezende P.J., and Lee D.T. Point set pattern matching in d-dimensions. Algorithmica 13 (1995) 387-404
17. Lee D.T., and Ching Y.T. The power of geometric duality revisited. Inform. Process. Lett. 21 (1985) 117-122
18. Akutsu T., Tamaki H., and Tokuyama T. Distribution of distances and triangles in a plane set and algorithms for computing the largest common point sets. Discrete Comput. Geometry 20 (1998) 307-331
19. Agarwal P.K., Aronov B., Sharir M., and Suri S. Selecting distances in the plane. Algorithmica 9 (1993) 495-514
20. Megiddo N. Applying parallel computation algorithms in the design of serial algorithms. J. Assoc. Comput. Mach. 30 (1983) 852-865
21. van Oostrum R., and Veltkamp R.C. Parametric search made practical. Proceedings of the 8th Annual Symposium on Computational Geometry (2002) 1-9
22. Agarwal P.K., and Sharir M. Efficient algorithm for geometric optimization. ACM Comput. Surv. 30 4 (1998) 412-458
23. Matousek J. On enclosing k points by a circle. Inform. Process. Lett. 53 (1995) 217-221
24. Arkin E.M., Kedem K., Mitchell J.S.B., Sprinzak J., and Werman M. Matching points into pairwise-disjoint noise regions: combinatorial bounds and algorithms. ORSA J. Comput. 4 (1992) 375-386
25. Chew L.P., Goodrich M.T., Huttenlocher D.P., Kedem K., Kleinberg J.M., and Kravets D. Geometric pattern matching under Euclidean motion. Comput. Geometry Theory Appl. 7 1-2 (1997) 113-124
26. H. Alt, B. Behrends, J. Blömer, Approximate matching of polygonal shapes, in: Proceedings of the ACM Symposium on Computational Geometry, 1991, pp. 186-193.
27. Atallah M.J. A linear time algorithm for Hausdorff distance between convex polygons. Inform. Process. Lett. 17 (1983) 207-209
28. Wells W.M. Statistical approaches to feature based object recognition. Int. J. Comput. Vision 21 (1997) 63-98
29. Fischler M.A., and Bolles R.C. Random sample consensus: a paradigm for model fitting with application to image analysis and automated cartography. Commun. Assoc. Comput. Mach 24 (1981) 381-395
30. J.R. Beveridge, C.R. Graves, J. Steinborn, Comparing random starts local search with key feature matching, in: Proceedings of the 15th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, 1997, pp. 1476-1481.
31. Gonzalez R.C., and Woods R.E. Digital Image Processing (1993), Addison-Wesley, Reading, MA
32. L.-H. Tung, I. King, P.-F. Fung, W.-S. Lee, Two-stage polygon representation for efficient shape retrieval in image databases, Proceedings of the First International Workshop on Image Databases and Multi-Media Search (IAPR '96), 1996, pp. 146-153.
33. Szekely L. Crossing numbers and Hard Erdös problems in discrete geometry. Combinatorics, Probab. Comput. 6 (1997) 353-358
34. Brown L.G. A survey of image registration techniques. ACM Comput. Surv. 24 4 (1992) 325-376
35. Goodman J.E., and Pollack R. Multidimensional sorting. SIAM J. Comput. 12 (1983) 484-507
36. Maltoni D., Maio D., Jain A.K., and Prabhakar S. Handbook of Fingerprint Recognition (2003), Springer, New York
37. G.T. Candela, P.J. Grother, C.I. Watson, R.A. Wilkinson, C.L. Wilson, PCASYS-a pattern-level classification automation system for fingerprints, NISTIR 5647, National Institute of Standards and Technology, August 1995.
38. C.I. Watson, Mated fingerprint card Pairs 2, Technical Report Special Database 14, MFCP2, National Institute of Standards and Technology, September 1993.
39. A. Bishnu, P. Bhowmick, J. Dey, B. B. Bhattacharya, M.K. Kundu, C.A. Murthy, T. Acharya, Combinatorial classification of pixels for ridge extraction in a gray-scale fingerprint image, in: Proceedings of the third Indian Conference on Computer Vision, Graphics and Image Processing, Ahmedabad, India, December 2002, pp. 451-456.
40. Farina A., Kovacs-Vajna Zs.M., and Leone A. Fingerprint minutiae extraction from skeletonized binary images. Pattern Recognition 32 (1999) 877-889
41. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs (1980), Academic Press, New York, NY
42. Mehlhorn K., and Näher S. LEDA: A Platform for Combinatorial and Geometric Computing (1999), Cambridge University Press, Cambridge, UK
43. 〈http://www.algorithmic-solutions.com/〉.
44. Maes M. Polygonal shape recognition using string-matching techniques. Pattern Recognition 24 (1991) 433-440
45. Manacher G. An application of pattern matching to a problem in geometrical complexity. Inform. Process. Lett. 53 (1995) 217-221