A Fingerprint Matching Method Based on Bipartite Graph Best Matching
A technology of optimal matching and matching method, which is applied in the field of image processing, can solve the problems of low matching accuracy rate of detail points, high misrecognition rate, and finger wounds, etc., to achieve both matching accuracy and computing time, and strong anti-noise ability , the effect of improving robustness
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0032] The technical solutions provided by the present invention will be described in detail below in conjunction with specific examples. It should be understood that the following specific embodiments are only used to illustrate the present invention and are not intended to limit the scope of the present invention.
[0033] The fingerprint matching method based on bipartite graph optimal matching that the present invention provides comprises the following steps:
[0034] Step A, firstly, label all minutiae points in input fingerprint I and template fingerprint T with I i (i∈1...m), T j (j∈1...n), where m is the number of minutiae points in the input fingerprint I, and n is the number of minutiae points in the template fingerprint T.
[0035] Step B, determine the similarity between the input fingerprint and any minutiae point pair of the template fingerprint: traverse all the minutiae points of the input fingerprint, and calculate I for the ith minutiae point in the input fi...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


