Random permutation Maxout transform for cancellable facial template protection

Beng Jin Teoh, Sejung Cho, Jihyeon Kim

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper, we propose a salting based two-factor cancelable biometrics construct, dubbed Random Permutation Maxout (RPM) transform for facial template protection. The RPM transform is inspired from a member of rank-based Locality Sensitive Hashing (LSH), namely Winner Takes All hashing, which was devised for data retrieval. With externally generated user-specific parameters, RPM converts a continuous facial feature vector into a max ranked indices vector as cancellable template. Since the features magnitude of facial features have been transformed to the discrete index form, the resulting template is robust against noises and it is strongly concealed from the adversary learning on the original facial features. This lays a strong promise on non-invertibility requirement The LSH theory compliance RPM is shown minimal performance deterioration after transform. The experimental results render reasonable accuracy performance on benchmark AR and FERET datasets. We also perform several rigorous security, privacy, revocability and unlinkability analyses, which are required for cancellable biometrics techniques.

Original languageEnglish
Pages (from-to)27733-27759
Number of pages27
JournalMultimedia Tools and Applications
Volume77
Issue number21
DOIs
Publication statusPublished - 2018 Nov 1

Fingerprint

Biometrics
Deterioration
Compliance

All Science Journal Classification (ASJC) codes

  • Software
  • Media Technology
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

@article{5ec594085eb54c28a15ca71651eaf10d,
title = "Random permutation Maxout transform for cancellable facial template protection",
abstract = "In this paper, we propose a salting based two-factor cancelable biometrics construct, dubbed Random Permutation Maxout (RPM) transform for facial template protection. The RPM transform is inspired from a member of rank-based Locality Sensitive Hashing (LSH), namely Winner Takes All hashing, which was devised for data retrieval. With externally generated user-specific parameters, RPM converts a continuous facial feature vector into a max ranked indices vector as cancellable template. Since the features magnitude of facial features have been transformed to the discrete index form, the resulting template is robust against noises and it is strongly concealed from the adversary learning on the original facial features. This lays a strong promise on non-invertibility requirement The LSH theory compliance RPM is shown minimal performance deterioration after transform. The experimental results render reasonable accuracy performance on benchmark AR and FERET datasets. We also perform several rigorous security, privacy, revocability and unlinkability analyses, which are required for cancellable biometrics techniques.",
author = "Teoh, {Beng Jin} and Sejung Cho and Jihyeon Kim",
year = "2018",
month = "11",
day = "1",
doi = "10.1007/s11042-018-5956-y",
language = "English",
volume = "77",
pages = "27733--27759",
journal = "Multimedia Tools and Applications",
issn = "1380-7501",
publisher = "Springer Netherlands",
number = "21",

}

Random permutation Maxout transform for cancellable facial template protection. / Teoh, Beng Jin; Cho, Sejung; Kim, Jihyeon.

In: Multimedia Tools and Applications, Vol. 77, No. 21, 01.11.2018, p. 27733-27759.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Random permutation Maxout transform for cancellable facial template protection

AU - Teoh, Beng Jin

AU - Cho, Sejung

AU - Kim, Jihyeon

PY - 2018/11/1

Y1 - 2018/11/1

N2 - In this paper, we propose a salting based two-factor cancelable biometrics construct, dubbed Random Permutation Maxout (RPM) transform for facial template protection. The RPM transform is inspired from a member of rank-based Locality Sensitive Hashing (LSH), namely Winner Takes All hashing, which was devised for data retrieval. With externally generated user-specific parameters, RPM converts a continuous facial feature vector into a max ranked indices vector as cancellable template. Since the features magnitude of facial features have been transformed to the discrete index form, the resulting template is robust against noises and it is strongly concealed from the adversary learning on the original facial features. This lays a strong promise on non-invertibility requirement The LSH theory compliance RPM is shown minimal performance deterioration after transform. The experimental results render reasonable accuracy performance on benchmark AR and FERET datasets. We also perform several rigorous security, privacy, revocability and unlinkability analyses, which are required for cancellable biometrics techniques.

AB - In this paper, we propose a salting based two-factor cancelable biometrics construct, dubbed Random Permutation Maxout (RPM) transform for facial template protection. The RPM transform is inspired from a member of rank-based Locality Sensitive Hashing (LSH), namely Winner Takes All hashing, which was devised for data retrieval. With externally generated user-specific parameters, RPM converts a continuous facial feature vector into a max ranked indices vector as cancellable template. Since the features magnitude of facial features have been transformed to the discrete index form, the resulting template is robust against noises and it is strongly concealed from the adversary learning on the original facial features. This lays a strong promise on non-invertibility requirement The LSH theory compliance RPM is shown minimal performance deterioration after transform. The experimental results render reasonable accuracy performance on benchmark AR and FERET datasets. We also perform several rigorous security, privacy, revocability and unlinkability analyses, which are required for cancellable biometrics techniques.

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

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

U2 - 10.1007/s11042-018-5956-y

DO - 10.1007/s11042-018-5956-y

M3 - Article

VL - 77

SP - 27733

EP - 27759

JO - Multimedia Tools and Applications

JF - Multimedia Tools and Applications

SN - 1380-7501

IS - 21

ER -