Abstract
In this paper, we present two hashing based techniques for fast palmprint identification. We first propose three properties required by a hash function and then introduce our first fast identification method based on orientation pattern (OP) hashing. We give the definition of OP and demonstrate that it meets all the requirements of the hash function, and thus, would be appropriate for hashing based fast palmprint identification. We then introduce the second fast identification method based on principal orientation pattern (POP) hashing. Because the POPs are constructed using more stable orientation features, POP hashing can find the target template more quickly thus causing earlier termination of the identification process. We evaluate our methods on the Hong Kong PolyU large-scale database (9667 palms) and the CASIA palmprint database (600 palms) plus a synthetic database (100 000 palms). Experimental results show that, on the Hong Kong PolyU large-scale database, the speedups of OP hashing and POP hashing over brute-force search are 16.93 and 19.91, respectively, and the identification accuracy is slightly higher. While on the CASIA database plus the synthetic database, the speedups of OP hashing and POP hashing are 8.03 and 15.67, respectively, and the identification accuracy almost remains the same. Results also show that, in terms of accuracy, our methods are comparable to several state-of-the-art palmprint identification approaches, while in terms of speed, our methods are much faster.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Information Forensics and Security
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.