The Science and Information (SAI) Organization
  • Home
  • About Us
  • Journals
  • Conferences
  • Contact Us

Publication Links

  • IJACSA
  • Author Guidelines
  • Publication Policies
  • Outstanding Reviewers

IJACSA

  • About the Journal
  • Call for Papers
  • Editorial Board
  • Author Guidelines
  • Submit your Paper
  • Current Issue
  • Archives
  • Indexing
  • Fees/ APC
  • Reviewers
  • Apply as a Reviewer

IJARAI

  • About the Journal
  • Archives
  • Indexing & Archiving

Special Issues

  • Home
  • Archives
  • Proposals
  • ICONS_BA 2025

Computer Vision Conference (CVC)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Computing Conference

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Intelligent Systems Conference (IntelliSys)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact

Future Technologies Conference (FTC)

  • Home
  • Call for Papers
  • Submit your Paper/Poster
  • Register
  • Venue
  • Contact
  • Home
  • Call for Papers
  • Editorial Board
  • Guidelines
  • Submit
  • Current Issue
  • Archives
  • Indexing
  • Fees
  • Reviewers
  • RSS Feed

DOI: 10.14569/IJACSA.2025.0161192
PDF

Bit Stability and Hash-Length Trade-Offs in Binary Face Templates

Author 1: Abdelilah Ganmati
Author 2: Karim Afdel
Author 3: Lahcen Koutti

International Journal of Advanced Computer Science and Applications(IJACSA), Volume 16 Issue 11, 2025.

  • Abstract and Keywords
  • How to Cite this Article
  • {} BibTeX Source

Abstract: Binary face templates are an appealing alternative to floating-point embeddings for face verification in resource-constrained environments because they enable constant-time Hamming matching with minimal storage and input/output (I/O). This paper studies the bit-level behavior of hashes obtained by principal component analysis followed by iterative quantization (PCA–ITQ) at L∈{32, 64, 128} derived from a frozen lightweight face encoder. Using subject-disjoint splits on the MORPH longitudinal dataset and an eyeglasses stress protocol on CelebA, the analysis quantifies 1) bit balance and entropy, 2) within-identity bit stability via per-bit flip rates, and 3) verification performance at low false-accept rates in Hamming space. On MORPH, 64-bit PCA–ITQ codes achieve an area under the receiver operating characteristic curve (AUC) of 0.9978 and a true positive rate (TPR) of 96.5% at a false positive rate (FPR) of 1%, compared to 99.1% at 128 bits, while halving the template length; 32-bit codes remain feasible but drop to 85.7% at the same operating point and are more sensitive to nuisance variation. Across both datasets, codes are near-balanced and mostly stable, yet a small minority of bit positions accounts for most flips under the eyeglasses attribute. In this regime, 64-bit hashes offer a favorable size–accuracy trade-off, whereas 128-bit hashes approximate float-embedding behavior and 32-bit hashes require redundancy or additional robustness mechanisms. All evaluations use fixed seeds and subject-disjoint splits; thresholds are selected on validation and held fixed on test to reflect deployment conditions.

Keywords: Binary face templates; face verification; hamming distance; PCA-ITQ; bit stability; eyeglasses attribute; resource-constrained verification; MORPH; CelebA

Abdelilah Ganmati, Karim Afdel and Lahcen Koutti. “Bit Stability and Hash-Length Trade-Offs in Binary Face Templates”. International Journal of Advanced Computer Science and Applications (IJACSA) 16.11 (2025). http://dx.doi.org/10.14569/IJACSA.2025.0161192

@article{Ganmati2025,
title = {Bit Stability and Hash-Length Trade-Offs in Binary Face Templates},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2025.0161192},
url = {http://dx.doi.org/10.14569/IJACSA.2025.0161192},
year = {2025},
publisher = {The Science and Information Organization},
volume = {16},
number = {11},
author = {Abdelilah Ganmati and Karim Afdel and Lahcen Koutti}
}



Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.

IJACSA

Upcoming Conferences

Computer Vision Conference (CVC) 2026

21-22 May 2026

  • Amsterdam, The Netherlands

Computing Conference 2026

9-10 July 2026

  • London, United Kingdom

Artificial Intelligence Conference 2026

3-4 September 2026

  • Amsterdam, The Netherlands

Future Technologies Conference (FTC) 2026

15-16 October 2026

  • Berlin, Germany
The Science and Information (SAI) Organization
BACK TO TOP

Computer Science Journal

  • About the Journal
  • Call for Papers
  • Submit Paper
  • Indexing

Our Conferences

  • Computer Vision Conference
  • Computing Conference
  • Intelligent Systems Conference
  • Future Technologies Conference

Help & Support

  • Contact Us
  • About Us
  • Terms and Conditions
  • Privacy Policy

The Science and Information (SAI) Organization Limited is a company registered in England and Wales under Company Number 8933205.