Abstract
This paper introduces a robust fingerprint matching scheme based on the comprehensive minutia and the binary relation between minutiae. In the method, a fingerprint is represented as a graph, of which the comprehensive minutiae act as the vertex set and the local binary minutia relations provide the edge set. Then, the transformation-invariant and transformation-variant features are extracted from the binary relation. The transformation-invariant features are suitable to estimate the local matching probability, whereas the transformation-variant features are used to model the fingerprint rotation transformation with the adaptive Parzen window. Finally, the fingerprint matching is conducted with the variable bounded box method and iterative strategy. The experiments demonstrate that the proposed scheme is effective and robust in fingerprint alignment and matching.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
