An Analysis of Random Projections in Cancelable Biometrics

by   Devansh Arpit, et al.

With increasing concerns about security, the need for highly secure physical biometrics-based authentication systems utilizing cancelable biometric technologies is on the rise. Because the problem of cancelable template generation deals with the trade-off between template security and matching performance, many state-of-the-art algorithms successful in generating high quality cancelable biometrics all have random projection as one of their early processing steps. This paper therefore presents a formal analysis of why random projections is an essential step in cancelable biometrics. By formally defining the notion of an Independent Subspace Structure for datasets, it can be shown that random projection preserves the subspace structure of data vectors generated from a union of independent linear subspaces. The bound on the minimum number of random vectors required for this to hold is also derived and is shown to depend logarithmically on the number of data samples, not only in independent subspaces but in disjoint subspace settings as well. The theoretical analysis presented is supported in detail with empirical results on real-world face recognition datasets.


page 1

page 2

page 3

page 4


Dimensionality Reduction with Subspace Structure Preservation

Modeling data as being sampled from a union of independent subspaces has...

A Novel Scheme for Generating Secure Face Templates Using BDA

In identity management system, frequently used biometric recognition sys...

Compressed Subspace Learning Based on Canonical Angle Preserving Property

A standard way to tackle the challenging task of learning from high-dime...

A Novel Approach For Generating Face Template Using Bda

In identity management system, commonly used biometric recognition syste...

Multiple Independent Subspace Clusterings

Multiple clustering aims at discovering diverse ways of organizing data ...

Improving Neural Network Training in Low Dimensional Random Bases

Stochastic Gradient Descent (SGD) has proven to be remarkably effective ...

CapProNet: Deep Feature Learning via Orthogonal Projections onto Capsule Subspaces

In this paper, we formalize the idea behind capsule nets of using a caps...

Please sign up or login with your details

Forgot password? Click here to reset