Fast Algorithm of Hough Transform-Based Approaches for Fingerprint Matching

As to the difficulty in low-quality fingerprint verification, an efficient algorithm of Hough transform-based fingerprint matching is developed. Firstly, minutiae vectors are established and classified to save according to vector modules. According to the vector databases, the parameter space of Hough transform is reduced and the method of classified saving decreases the searching space when searching for mated vector. At last, matching radius are set dynamically according to the experience that the elastic deformation of periphery is larger than of center. In order to test this algorithm, experiments are conducted and results show that the algorithm can simplify the complexity of parameter space significantly and solve the problem that too much calculation and memory space are needed for the regular approach. Moreover, it is of very strong robustness and can deal with low-quality fingerprint image in a satisfactory way.