Facebook pixel tracking

The Science and Information (SAI) Organization publishes open-access peer-reviewed journals in computer science and artificial intelligence.

Contact Info
Website thesai.org
Follow Us
Contact Info
Follow Us
Research Article | Open Access |

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) · Vol. 16, No. 11 · Published 2025

DOI: https://doi.org/10.14569/IJACSA.2025.0161192

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

How to Cite this Article

Ganmati, A., Afdel, K., & Koutti, L. (2025). Bit Stability and Hash-Length Trade-Offs in Binary Face Templates. International Journal of Advanced Computer Science and Applications, 16(11). https://doi.org/10.14569/IJACSA.2025.0161192

Ganmati, Abdelilah, et al.. "Bit Stability and Hash-Length Trade-Offs in Binary Face Templates." International Journal of Advanced Computer Science and Applications, vol. 16, no. 11, 2025, https://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},
  volume    = {16},
  number    = {11},
  year      = {2025},
  publisher = {The Science and Information Organization},
  author    = {Abdelilah Ganmati and Karim Afdel and Lahcen Koutti},
  doi       = {10.14569/IJACSA.2025.0161192},
  url       = {https://doi.org/10.14569/IJACSA.2025.0161192}
}

Open Access — licensed under a Creative Commons Attribution 4.0 International License. Unrestricted use, distribution, and reproduction in any medium, even commercially, as long as the original work is properly cited.