Sparse representations and random projections for robust and cancelable biometrics

Vishal M. Patel; Rama Chellappa; Massimo Tistarelli

doi:10.1109/ICARCV.2010.5707955

Sparse representations and random projections for robust and cancelable biometrics

Vishal M. Patel, Rama Chellappa, Massimo Tistarelli

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In recent years, the theories of Sparse Representation (SR) and Compressed Sensing (CS) have emerged as powerful tools for efficiently processing data in non-traditional ways. An area of promise for these theories is biometric identification. In this paper, we review the role of sparse representation and CS for efficient biometric identification. Algorithms to perform identification from face and iris data are reviewed. By applying Random Projections it is possible to purposively hide the biometric data within a template. This procedure can be effectively employed for securing and protecting personal biometric data against theft. Some of the most compelling challenges and issues that confront research in biometrics using sparse representations and CS are also addressed.

Original language	English (US)
Title of host publication	11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010
Pages	1-6
Number of pages	6
DOIs	https://doi.org/10.1109/ICARCV.2010.5707955
State	Published - 2010
Externally published	Yes
Event	11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010 - Singapore, Singapore Duration: Dec 7 2010 → Dec 10 2010

Publication series

Name	11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010

Other

Other	11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010
Country/Territory	Singapore
City	Singapore
Period	12/7/10 → 12/10/10

Keywords

Cancelable biometrics
Face recognition
Iris recognition
Random projections
Sparse representations

ASJC Scopus subject areas

Artificial Intelligence
Control and Systems Engineering

Access to Document

10.1109/ICARCV.2010.5707955

Cite this

Patel, V. M., Chellappa, R., & Tistarelli, M. (2010). Sparse representations and random projections for robust and cancelable biometrics. In 11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010 (pp. 1-6). Article 5707955 (11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010). https://doi.org/10.1109/ICARCV.2010.5707955

Sparse representations and random projections for robust and cancelable biometrics. / Patel, Vishal M.; Chellappa, Rama; Tistarelli, Massimo.
11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010. 2010. p. 1-6 5707955 (11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Patel, VM, Chellappa, R & Tistarelli, M 2010, Sparse representations and random projections for robust and cancelable biometrics. in 11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010., 5707955, 11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010, pp. 1-6, 11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010, Singapore, Singapore, 12/7/10. https://doi.org/10.1109/ICARCV.2010.5707955

@inproceedings{e1d3d89ffcc1403ebd494b183d46d601,

title = "Sparse representations and random projections for robust and cancelable biometrics",

abstract = "In recent years, the theories of Sparse Representation (SR) and Compressed Sensing (CS) have emerged as powerful tools for efficiently processing data in non-traditional ways. An area of promise for these theories is biometric identification. In this paper, we review the role of sparse representation and CS for efficient biometric identification. Algorithms to perform identification from face and iris data are reviewed. By applying Random Projections it is possible to purposively hide the biometric data within a template. This procedure can be effectively employed for securing and protecting personal biometric data against theft. Some of the most compelling challenges and issues that confront research in biometrics using sparse representations and CS are also addressed.",

keywords = "Cancelable biometrics, Face recognition, Iris recognition, Random projections, Sparse representations",

author = "Patel, {Vishal M.} and Rama Chellappa and Massimo Tistarelli",

year = "2010",

doi = "10.1109/ICARCV.2010.5707955",

language = "English (US)",

isbn = "9781424478132",

series = "11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010",

pages = "1--6",

booktitle = "11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010",

note = "11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010 ; Conference date: 07-12-2010 Through 10-12-2010",

}

TY - GEN

T1 - Sparse representations and random projections for robust and cancelable biometrics

AU - Patel, Vishal M.

AU - Chellappa, Rama

AU - Tistarelli, Massimo

PY - 2010

Y1 - 2010

N2 - In recent years, the theories of Sparse Representation (SR) and Compressed Sensing (CS) have emerged as powerful tools for efficiently processing data in non-traditional ways. An area of promise for these theories is biometric identification. In this paper, we review the role of sparse representation and CS for efficient biometric identification. Algorithms to perform identification from face and iris data are reviewed. By applying Random Projections it is possible to purposively hide the biometric data within a template. This procedure can be effectively employed for securing and protecting personal biometric data against theft. Some of the most compelling challenges and issues that confront research in biometrics using sparse representations and CS are also addressed.

AB - In recent years, the theories of Sparse Representation (SR) and Compressed Sensing (CS) have emerged as powerful tools for efficiently processing data in non-traditional ways. An area of promise for these theories is biometric identification. In this paper, we review the role of sparse representation and CS for efficient biometric identification. Algorithms to perform identification from face and iris data are reviewed. By applying Random Projections it is possible to purposively hide the biometric data within a template. This procedure can be effectively employed for securing and protecting personal biometric data against theft. Some of the most compelling challenges and issues that confront research in biometrics using sparse representations and CS are also addressed.

KW - Cancelable biometrics

KW - Face recognition

KW - Iris recognition

KW - Random projections

KW - Sparse representations

UR - http://www.scopus.com/inward/record.url?scp=79952375147&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952375147&partnerID=8YFLogxK

U2 - 10.1109/ICARCV.2010.5707955

DO - 10.1109/ICARCV.2010.5707955

M3 - Conference contribution

AN - SCOPUS:79952375147

SN - 9781424478132

T3 - 11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010

SP - 1

EP - 6

BT - 11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010

T2 - 11th International Conference on Control, Automation, Robotics and Vision, ICARCV 2010

Y2 - 7 December 2010 through 10 December 2010

ER -

Sparse representations and random projections for robust and cancelable biometrics

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this