Journal of Korea Multimedia Society (한국멀티미디어학회논문지)

Korea Multimedia Society (한국멀티미디어학회)
권호 표지

Point Pattern Matching Algorithm Using Unit-Circle Parametrization

  • Received : 2009.07.29
  • Accepted : 2010.06.11
  • Published : 2010.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper presents only a matching algorithm based on Delaunay triangulation and Parametrization from the extracted minutiae points. This method maps local neighborhood of points of two different point sets to unit-circle using topology information by Delaunay triangulation method from feature points of real fingerprint. Then, a linked convex polygon that includes an interior point is constructed as one-ring which is mapped to unit-circle using Parametrization that keep shape preserve. In local matching, each area of polygon in unit-circle is compared. If the difference of two areas are within tolerance, two polygons are consider to be matched and then translation, rotation and scaling factors for global matching are calculated.

Keywords

References

  1. Wamelen P. B. Van, Li Z., and Iyengar S. S.: "A fast expected time algorithm for the 2-D point pattern matching problem, Pattern Recognition" 37, Elsevier Ltd, pp. 1699-1711, (2004) https://doi.org/10.1016/j.patcog.2003.12.009
  2. Jain, A., and Pankanti, S., Fingerprint Classification and Matching, Handbook for Image and Video Processing, A. Bovik (ed.), Academic Press, April 2000.
  3. H. Ogawa, "Labeled point pattern matching by fuzzy relaxation.", Pattern Recognition, 17(5) (1984): 569-573 https://doi.org/10.1016/0031-3203(84)90055-4
  4. S. - H. Chang, F. - H. Cheng, W. - H. Hsu, and G. - Z. Wu. "Fast algorithm for point pattern matching: Invariant to translations, rotations and scale changes.", Pattern Recognition, 1997 30(2): 311-320 https://doi.org/10.1016/S0031-3203(96)00076-3
  5. G. Percus, and O. C. Martin, "Scaling unisealities of k-th nearest neighbor distances on closed manifolds Adv.", In Appl. Math, 21 (1998) 3, 424-436.
  6. G. Leach, "Improving Worst-Case Optimal Delaunay Triangulation Algorithms", proceedings of the 4th Canadian Conference on Computational Geometry, 340-346, June 1992.
  7. M. S. Floater, "Parametrization and smooth approximation of surface triangulations", Comp. Aided Geom: Design, 14 (1997), 231-250. https://doi.org/10.1016/S0167-8396(96)00031-3