Fast fingerprint matching based on the novel structure combining the singular point with its neighborhood minutiae

It is a very demanding task to design a reliable fingerprint matching approach with high accuracy and speed. An algorithm based on the novel structure combining the singular point with its neighborhood minutiae proposed in this paper can solve this problem efficiently. The structure introduced in this paper has two novel ideas as follows: First, we give an efficient singular points detection method by the inter-relation ship between the singular points and the minutiae around them. It can reject the spurious singular points detected by the Poincare index. Second, an improvement of minutiae pairing strategy is introduced, which can sharply decrease the number of candidate minutiae pairs. Experiment results show that these improvements can highly speed up the matching with a preferable accuracy. This algorithm can be used in the one-to-many matching of the on-line fingerprint identification system.