The Johnson-Lindenstrauss Lemma and the sphericity of some graphs
Journal of Combinatorial Theory Series A
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
The FERET Evaluation Methodology for Face-Recognition Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Database-friendly random projections
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Random projection in dimensionality reduction: applications to image and text data
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Experiments with Random Projection
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
An Algorithmic Theory of Learning: Robust Concepts and Random Projection
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The CMU Pose, Illumination, and Expression Database
IEEE Transactions on Pattern Analysis and Machine Intelligence
Cancelable Biometric Filters for Face Recognition
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03
Reusable cryptographic fuzzy extractors
Proceedings of the 11th ACM conference on Computer and communications security
Face Recognition with Renewable and Privacy Preserving Binary Templates
AUTOID '05 Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies
IEEE Transactions on Knowledge and Data Engineering
Robust Distance Measures for Face-Recognition Supporting Revocable Biometric Tokens.
FGR '06 Proceedings of the 7th International Conference on Automatic Face and Gesture Recognition
Very sparse random projections
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Combining Crypto with Biometrics Effectively
IEEE Transactions on Computers
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
On solving the face recognition problem with one training sample per subject
Pattern Recognition
Remarks on BioHash and its mathematical foundation
Information Processing Letters
Generating Cancelable Fingerprint Templates
IEEE Transactions on Pattern Analysis and Machine Intelligence
Journal of Cognitive Neuroscience
Vulnerabilities in biometric encryption systems
AVBPA'05 Proceedings of the 5th international conference on Audio- and Video-Based Biometric Person Authentication
Protecting Biometric Templates With Sketch: Theory and Practice
IEEE Transactions on Information Forensics and Security - Part 2
Cancelable Biometrics Realization With Multispace Random Projections
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A New Method for Generating an Invariant Iris Private Key Based on the Fuzzy Vault System
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An introduction to biometric recognition
IEEE Transactions on Circuits and Systems for Video Technology
Biometric hash: high-confidence face recognition
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.00 |
Changeability and privacy protection are important factors for widespread deployment of biometrics-based verification systems. This paper presents a systematic analysis of a random-projection (RP)-based method for addressing these problems. The employed method transforms biometric data using a random matrix with each entry an independent and identically distributed Gaussian random variable. The similarity- and privacy-preserving properties, as well as the changeability of the biometric information in the transformed domain, are analyzed in detail. Specifically, RP on both high-dimensional image vectors and dimensionality-reduced feature vectors is discussed and compared. A vector translation method is proposed to improve the changeability of the generated templates. The feasibility of the introduced solution is well supported by detailed theoretical analyses. Extensive experimentation on a face-based biometric verification problem shows the effectiveness of the proposed method.