Title :
Matching reduction of 2DPalmHash Code
Author :
Lu Leng ; Ming Li ; Teoh, Andrew Beng Jin
Author_Institution :
Key Lab. of Nondestructive Test (Minist. of Educ.), Nanchang Hangkong Univ., Nanchang, China
Abstract :
2DPalmHash Code (2DPHC), which is constructed based on Gabor filter, is a cancelable palmprint coding scheme for secure palmprint verification. In this scheme, multiple-translated matchings between two 2DPHCs are performed to remedy the vertical and horizontal dislocation problems of Gabor feature matrix. According to the analysis, vertical translation matching fixes the vertical dislocation, but the horizontal translation matching does not work out horizontal dislocation. Therefore, the computation of multiple-translated matching of 2DPHC can be reduced by discarding the horizontal translation matching. The matching reduction not only reduces the computational complexity of matching, but also improves the verification performance and enhances the changeability capacity of 2DPHC as a cancelable scheme.
Keywords :
Gabor filters; computational complexity; image coding; image filtering; image matching; matrix algebra; palmprint recognition; 2DPHC; 2DPalmHash code; Gabor feature matrix; Gabor filter; cancelable palmprint coding scheme; cancelable scheme; changeability capacity enhancement; computational complexity; horizontal dislocation problem; horizontal translation matching; matching reduction; multiple-translated matchings; palmprint verification; verification performance; vertical dislocation problem; vertical translation; Biometrics (access control); Computational complexity; Cryptography; Educational institutions; Encoding; Gabor filters; 2DPalmHash Code; cancelable palmprint; matching reduction; multiple-translated matching;
Conference_Titel :
Biometrics and Security Technologies (ISBAST), 2014 International Symposium on
Conference_Location :
Kuala Lumpur
Print_ISBN :
978-1-4799-6443-7
DOI :
10.1109/ISBAST.2014.7013107