
Fingerprint enhancement using multi‐scale classification dictionaries with reduced dimensionality
Author(s) -
Xu Deqin,
Bian Weixin,
Cheng Yongqiang,
Li Qingde,
Luo Yonglong,
Yu Qingying
Publication year - 2020
Publication title -
iet biometrics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.434
H-Index - 28
eISSN - 2047-4946
pISSN - 2047-4938
DOI - 10.1049/iet-bmt.2019.0121
Subject(s) - computer science , pattern recognition (psychology) , dimensionality reduction , principal component analysis , curse of dimensionality , fingerprint (computing) , artificial intelligence , robustness (evolution) , sparse approximation , fingerprint recognition , biometrics , data mining , scale (ratio) , biochemistry , chemistry , physics , quantum mechanics , gene
In order to improve the quality of fingerprint with a large noise, this study proposes a fingerprint enhancement method by using a sparse representation of learned multi‐scale classification dictionaries with reduced dimensionality. The multi‐scale dictionary is used to balance the contradiction between the accuracy and the anti‐noise ability, which is an ideal solution to reconcile the demands of enhancement quality and computational performance. The principal component analysis is applied in the authors’ technique for dimension reduction of multi‐scale classification dictionaries. Under the quality grading scheme and multi‐scale composite windows, the fingerprint patches are enhanced by using a sparse representation of learned multi‐scale classification dictionaries with reduced dimensionality according to their priorities. In addition, the multi‐scale composite windows help the more high‐quality spectra diffuse into the low‐quality fingerprint patches and this can greatly improve the spectra quality of them. Experimental results and comparisons on FVC 2000 and FVC 2004 databases are reported. And it shows that the proposed method yields better results in terms of the robustness of fingerprint enhancement as compared with the latest techniques. Moreover, the results show that the proposed algorithm can obtain better identification performance.