Skip to main content

A Fast Fingerprint Matching Approach in Medicare Identity Verification Based on GAs

  • Conference paper
Advances in Natural Computation (ICNC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3612))

Included in the following conference series:

  • 2332 Accesses

  • 2 Citations

Abstract

This paper presents an approach to the problem of the identity verification speed by means of fingerprint pattern recognition in the Medicare real-time settlement system. This study aims to speed up the fingerprint feature transmission by greatly reducing the space of feature, and improve fingerprint matching speed under a comparative matching precision. To solve the problem, we take several aspects into consideration: reducing the space of one minutiae point occupied, abandoning the global feature to reduce the feature space, depending on the definition of minutiae point’s direction and restriction of transformation for precision, and controlling the number of evolutionary species by searching the optimization parameters. The experiment results indicate that this approach manages to speed up the transmission and matching effectively, and therefore prove to be suitable for the Medicare identity verification.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Sanjay, R., Azriel, R.: Point pattern matching by relaxation. Pattern Recognition 12, 269–275 (1980)

    Article  Google Scholar 

  2. Ratkovic, J.P.: Increasing efficiency in the criminal justice system: the use of new technology for criminal verification and latent print processing. The Rand Corporation, California (1980)

    Google Scholar 

  3. Sparrow, M.K., Sparrow, P.J.: A topological approach to the matching of single fingerprints: development of algorithms for use on rolled impressions. National Bureau of Standards Special Publication, Washington (1985)

    Google Scholar 

  4. Hrechak, A.K., Mchugh, J.A.: Automated fingerprint recognition using structural matching. Pattern Recognition 23, 893–904 (1990)

    Article  Google Scholar 

  5. Skea, D., Barrodale, I., Kuwahara, R., Poeckert, R.: A Control Point Matching Algorithm. Pattern Recognition 26 (1993)

    Google Scholar 

  6. Suganthan, P.N.: Structural pattern recognition using genetic algorithms. Pattern Recognition 35, 1883–1893 (2002)

    Article  MATH  Google Scholar 

  7. Jun, H., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence, 57–85 (2001)

    Google Scholar 

  8. Jain, A., Hong, L., Bolle, R.: Online Fingerprint Verification. Pattern Analysis and Machine Intelligence 19 (1997)

    Google Scholar 

  9. Michalewicz, Z.: Genetic Algorithm + Data Structure = Evolution Programs, 3rd edn. Springer, New York (1996)

    Google Scholar 

  10. Yao, X.: Evolutionary computation comes of age. Journal of Cognitive Systems Research, 59–64 (1999)

    Google Scholar 

  11. Yao, X.: Evolutionary Computation: Theory and Applications. World Scientific, Singapore (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Q., Rong, L. (2005). A Fast Fingerprint Matching Approach in Medicare Identity Verification Based on GAs. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_18

Download citation

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us

Policies and ethics