Paper Info
Title
Matching reduction of 2DPalmHash Code
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.
Year
DOI
Venue
2014
10.1109/ISBAST.2014.7013107
ISBAST
Keywords
Field
DocType
2dpalmhash code,palmprint recognition,image coding,image matching,multiple-translated matchings,gabor filters,multiple-translated matching,horizontal dislocation problem,horizontal translation matching,cancelable palmprint coding scheme,matrix algebra,vertical dislocation problem,gabor filter,gabor feature matrix,matching reduction,computational complexity,vertical translation,changeability capacity enhancement,verification performance,image filtering,2dphc,cancelable palmprint,cancelable scheme,palmprint verification
Horizontal translation,Vertical translation,Horizontal and vertical,Pattern recognition,Computer science,Coding (social sciences),Gabor filter,Artificial intelligence,Dislocation,Computational complexity theory,Computation
Conference
ISBN
Citations 
PageRank 
978-1-4799-6443-7
0
0.34
References 
Authors
12
3
Name
Order
Citations
PageRank
Lu Leng12009.83
Ming Li219625.50
Andrew Beng Jin Teoh31778125.80