Sparse Matrix Fingerprint Matching AIgorithm Based on the Strategy Optimization of RANSAC AIgorithm
Aiming at the deficiency of the matching speed and accuracy of the fingerprint matching algorithm based on point pattern, proposes a new fingerprint matching algorithm by discussing the existing algorithms. According to the sparse matrix computing speed and storage capacity of small features, the sparse matrix is applied to the fingerprint matching algorithm to handle initial fingerprint image matching in this paper. And through the RANSAC algorithm for the second time overall matching, to maintain a higher algorithm speed, at the same time, to ensure the accuracy of the matching. The experimental results show that the algorithm has good matching speed, low error rate, high accuracy, and has good performance in all aspects, and it is expected to be a practical and effective matching algorithm.
NETL
NSTL
万方数据
维普
