Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Random Subspace Method for Constructing Decision Forests
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multiclass Linear Dimension Reduction by Weighted Pairwise Fisher Criteria
IEEE Transactions on Pattern Analysis and Machine Intelligence
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
An enhanced subspace method for face recognition
Pattern Recognition Letters
Boosting in Random Subspaces for Face Recognition
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 01
An improved BioHashing for human authentication
Pattern Recognition
An analysis of BioHashing and its variants
Pattern Recognition
Random sampling LDA for face recognition
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Near Infrared Face Based Biometric Key Binding
ICB '09 Proceedings of the Third International Conference on Advances in Biometrics
Minutiae and modified Biocode fusion for fingerprint-based key generation
Journal of Network and Computer Applications
Cancelable fingerprint templates using minutiae-based bit-strings
Journal of Network and Computer Applications
Orthogonal linear discriminant analysis and feature selection for micro-array data classification
Expert Systems with Applications: An International Journal
Wavelet selection for disease classification by DNA microarray data
Expert Systems with Applications: An International Journal
Pair-polar coordinate-based cancelable fingerprint templates
Pattern Recognition
Hi-index | 0.10 |
Verification based on tokenised pseudo-random numbers and user specific biometric feature has received much attention. In this paper, we propose a BioHashing system for automatic face recognition based on Fisher-based Feature Transform, a supervised transform for dimensionality reduction that has been proved to be very effective for the face recognition task. Since the dimension of the Fisher-based transformed space is bounded by the number of classes - 1, we use random subspace to create K feature spaces to be concatenated in a new higher dimensional space, in order to obtain a big and reliable ''BioHash code''.