University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Analysis of performance of palmprint matching with enforced sparsity

Nibouche, O, Jiang, J and Trundle, P (2012) Analysis of performance of palmprint matching with enforced sparsity Digital Signal Processing: A Review Journal, 22 (2). pp. 348-355.

Full text not available from this repository.

Abstract

In this paper, a new and simple palmprint recognition solution based on sparse representation is suggested. It is shown that when the aim is to recover a palmprint from a limited number of observations as a linear combination of measurements of the same palmprint class, the ensuing representation in intrinsically very sparse. It can be efficiently computed by solving an l1 norm convex minimisation problem. When combined with well known subspace feature selection techniques such as PCA and LDA as well as with downsampled images, our tests, which have been carried out on 250 classes of the widely used PolyU database, have yielded an EER as low as 0.11% depending on the palmprints selected during the enrolment phase. Coupled with an execution time as short as 8.4 ms, the obtained results outperform similar work in the literature including EigenPalms, FisherPalms and Gabor based palmprintmatching algorithms, which shows the effectiveness of the new solution.

Item Type: Article
Authors :
NameEmailORCID
Nibouche, OUNSPECIFIEDUNSPECIFIED
Jiang, Jjianmin.jiang@surrey.ac.ukUNSPECIFIED
Trundle, PUNSPECIFIEDUNSPECIFIED
Date : 2012
Identification Number : https://doi.org/10.1016/j.dsp.2011.10.011
Depositing User : Symplectic Elements
Date Deposited : 17 May 2017 12:25
Last Modified : 17 May 2017 15:03
URI: http://epubs.surrey.ac.uk/id/eprint/835277

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800