Modeling and analysis of local comprehensive minutia relation for fingerprint matching

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.