mlsanityData to 14 Oct 2026

MLP-Hash: Protecting Face Templates via Hashing of Randomized Multi-Layer Perceptron

arXiv 2204.11054 ↗First posted 23 Apr 2022cs.CV cs.CRcited by 5

Not on the map. Why?

Abstract (arXiv)

Applications of face recognition systems for authentication purposes are growing rapidly. Although state-of-the-art (SOTA) face recognition systems have high recognition accuracy, the features which are extracted for each user and are stored in the system's database contain privacy-sensitive information. Accordingly, compromising this data would jeopardize users' privacy. In this paper, we propose a new cancelable template protection method, dubbed MLP-hash, which generates protected templates by passing the extracted features through a user-specific randomly-weighted multi-layer perceptron (MLP) and binarizing the MLP output. We evaluated the unlinkability, irreversibility, and recognition accuracy of our proposed biometric template protection method to fulfill the ISO/IEC 30136 standard requirements. Our experiments with SOTA face recognition systems on the MOBIO and LFW datasets show that our method has competitive performance with the BioHashing and IoM Hashing (IoM-GRP and IoM-URP) template protection algorithms. We provide an open-source implementation of all the experiments presented in this paper so that other researchers can verify our findings and build upon our work.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 4 of its 27 references that are in the map. First posted on arXiv 23 Apr 2022.

Builds on

4 of 27 references.

References · 4

  1. 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,849
  2. 2017On the Reconstruction of Face Images from Deep Face Templatescited by 67
  3. 2017Ranking Based Locality Sensitive Hashing Enabled Cancelable Biometrics: Index-of-Max Hashingcited by 21
  4. 2021Towards Protecting Face Embeddings in Mobile Face Verification Scenarioscited by 14

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 3; 2025: 1.

5 papers.