Fingerprint Matching Based on Ternary Vector

Fingerprint matching is an essential step in fingerprint recognition applications. In order to obtain rapid and efficient fingerprint matching algorithm, a fingerprint matching algorithm based on ternary vector is introduced in this paper. The ternary vector captures the neighborhood information of the ridges, orientation and minutiae for each minutiae. These pairs of aligning minutiae are determined by the similarity of the ternary vector. Then the aligning pairs are used to align the fingerprints for matching. And the ternary vector is also used for the matching similarity computation. The minutiae are ordered storage with minutiae orientation to speed the matching process. The experimental results show that the ternary vector based matching method can reduce the storage space, time complexity, and improve the performance of the fingerprint matching.