Research On The Fingerprint Identification Arithmetic

With the development the technology, fingerprint identification technology is applied in kinds of fields. To different fields, the automatic fingerprint identification system must be satisfied with different capability demand. Used in identifying criminal identity, the fingerprint identification system must have high reliability. But if it is used in small fingerprint identification system, It must have low complication, high operation rate, so it can be content with real time demands. In conclusion, it is required to research different kinds of identification arithmetic and make them to fit for the demands about different aspects of reliability, real time and validity. This paper focuses on a small fingerprint identification system. To the existing previous process arithmetic, pick-up minutia arithmetic, fingerprint matching arithmetic, this paper makes some improvement to attain high operation rate, high identify efficiency, low cost also be easier to study and use. The arithmetic is carried out in VC++6.0 and through experiment to validate its reliability and efficiency. This paper does some aspects of work about automatic fingerprint identification system: 1. Prompt a method of three-step division to divide fingerprint image. 2. Introduce F-transformation to realize fingerprintenhance, and use the two-direction filter to mend fingerprint lines again. 3. Part self-adapt process method to binary image and then filter the yawp. 4. Use thinner template to thin the image and then eliminate fake minutia. 5. Use 8-adjacent threshold method to pick-up minutia directly from binary image. 6. Add a behind-process after picking-up minutia to increase precision. 7. Base on point-mode method to match minutia. 8. Carry out the arithmetic by programming in VC++6.0.