Skip to main content
SpringerLink
Log in

The problem of fingerprint identification: A reference database indexing method based on Delaunay triangulation

  • Applied Problems
  • Published:
Pattern Recognition and Image Analysis Aims and scope Submit manuscript

Abstract

The class of problems of biometrical identification using fingerprints taken by an optical scanner is studied. A new approach to developing highly efficient identification algorithms based on preliminary indexing of the reference fingerprint database using Delaunay triangulation is proposed. Analysis of numerical experiments proved the proposed method to have high generalization ability and be stable to small perturbations of the original fingerprints.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. D. Maltoni, D. Maio, A. K. Jain, and S. Prabhakar, Handbook of Fingerprint Recognition (Springer, New York, 2005).

    Google Scholar 

  2. B. Bhanu and X. Tan, Computational Algorithms for Fingerprint Recognition (Kluwer Acad. Publ., Boston, 2004).

    Book  MATH  Google Scholar 

  3. D. Maio and D. Maltoni, “Direct gray-scale minutiae detection in fingerprints,” IEEE Trans. Pattern Anal. Mach. Intellig. 29(1), 27–40 (1997).

    Article  Google Scholar 

  4. Y. Neil and A. Adnan, “Fingerprint verification based on minutiae features: a review,” Pattern Anal. Appl. 7(1), 94–113 (2004).

    MathSciNet  Google Scholar 

  5. NIST Special Database 4. http://www.nist.gov/srd/nistsd4.cfm

  6. G. Bebis, T. Deaconu, and M. Georgiopulos, “Fingerprint identification using Delaunay triangulation,” in Proc. IEEE Int. Conf. on Intelligence, Information, and Systems, ICIIS (Washington, 1999).

    Google Scholar 

  7. Q. Du and D. Wang, “Recent progress in robust and quality Delaunay mesh generation,” J. Comput. Appl. Math. 195(1–2), 8–23 (2006).

    Article  MATH  MathSciNet  Google Scholar 

  8. A. V. Skvortsov, “A survey of algorithms fro constructing a Delaunay triangulation,” Num. Methods Programm. 3 Sect. 1, 14–39 (2002).

    Google Scholar 

  9. L. Guibas, D. Knuth, and M. Sharir, “Randomized incremental construction of Delaunay and Voronoi diagrams,” Algorithmica. 7, 381–413 (1992).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, ul. S. Kovalevskoi 16, Yekaterinburg, 620990, Russia

    M. Yu. Khachai, A. S. Leshko & A. V. Dremin

  2. Yeltsin Ural Federal University, ul. Mira 19, Yekaterinburg, 620002, Russia

    M. Yu. Khachai, A. S. Leshko & A. V. Dremin

  3. Omsk State Technical University, pr. Mira 11, Omsk, 644050, Russia

    M. Yu. Khachai, A. S. Leshko & A. V. Dremin

Authors
  1. M. Yu. Khachai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. S. Leshko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. V. Dremin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Yu. Khachai.

Additional information

This article uses the materials of the report submitted at the 4th International Workshop “Image Mining. Theory and Applications”, Barcelona, Spain, February 2013

Mikhail Yu. Khachai. Born 1970 in Krasnotur’insk, Sverdlovsk region. Graduated from Gorkov Ural State University (Department of Mathematics and Mechanics) in 1993. Received Candidate of Sciences degree in 1996 and Doctor of Sciences degree in 2005 (both in Discrete Mathematics and Mathematical Cybernetics). Since 1994, works at Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences; since 2007, head of the mathematical programming department. Scientific interests: mathematical learning theory and combinatorial optimization. Author of 112 scientific publications, including 17 in PRIA. Member of the Russian Association of Pattern Recognition and Image Analysis.

Anton S. Leshko. Born 1983 in Nev’yansk, Sverdlovsk region. Graduated from Ural State Technical University (Department of Radio Engineering) in 2006. Worked for NPO Avtomatika 2004–2006 and for OOO ProsoftSistemy 2006–2011. Since 2011, works for the Technical Center for Cooperation with Law Enforcement Agencies “Poligon” in cooperation with Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences. Scientific interests: pattern recognition, computer vision, intelligent tracking systems, distributed computing.

Aleksandr V. Dremin. Born 1976. Graduated from Ural State Technical University (Department of Radio Engineering) in 1998. Leading developer of electronic devices in Tekhneks 1999–2002. Works for ProsoftSistemy, Yekaterinburg, since 2003. Since 2012, postgraduate student in Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences. Scientific interests: design and development of hardware and software complexes for biometrical identification.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Khachai, M.Y., Leshko, A.S. & Dremin, A.V. The problem of fingerprint identification: A reference database indexing method based on Delaunay triangulation. Pattern Recognit. Image Anal. 24, 297–303 (2014). https://doi.org/10.1134/S1054661814020102

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1054661814020102

Keywords

Search

Navigation