An analytic performance estimation framework for multibit biometric discretization based on equal-probable quantization and linearly separable subcode encoding

Meng Hui Lim, Beng Jin Teoh

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Biometric discretization derives a binary string for each user based on an ordered set of real-valued biometric features. The false acceptance rate (FAR) and the false rejection rate (FRR) of a binary biometric-based system significantly relies on a Hamming distance threshold which decides whether the errors in the query bit string will be rectified with reference to the template bit string. Kelkboom have recently modeled a basic framework to estimate the FAR and the FRR of one-bit biometric discretization. However, as the demand of a bit string with higher entropy (informative length) rises, single-bit discretization is getting less useful today due to its incapability of producing bit string that is longer than the total feature dimensions being extracted, thus causing Kelkboom's model to be of restricted use. In this paper, we extend the analytical framework to multibit discretization for estimating the performance and the decision threshold for achieving a specified FAR/FRR based on equal-probable quantization and linearly separable subcode encoding. Promising estimation results on a synthetic data set with independent feature components and Gaussian measurements vindicate the analytical expressions of our framework. However, for experiments on two popular face data sets, deviation in estimation results were obtained mainly due to the mismatch of independency assumption of our framework. We hence fit the analytical probability mass functions (pmfs) to the experimental pmfs through estimating the mean and the variance parameters from the difference between the corresponding analytical and experimental curves to alleviate such estimation inaccuracies on these data sets.

Original languageEnglish
Article number6175121
Pages (from-to)1242-1254
Number of pages13
JournalIEEE Transactions on Information Forensics and Security
Volume7
Issue number4
DOIs
Publication statusPublished - 2012 Jul 23

Fingerprint

Biometrics
Hamming distance
Entropy
Experiments

All Science Journal Classification (ASJC) codes

  • Safety, Risk, Reliability and Quality
  • Computer Networks and Communications

Cite this

@article{208655061dde46498bae266bdb363871,
title = "An analytic performance estimation framework for multibit biometric discretization based on equal-probable quantization and linearly separable subcode encoding",
abstract = "Biometric discretization derives a binary string for each user based on an ordered set of real-valued biometric features. The false acceptance rate (FAR) and the false rejection rate (FRR) of a binary biometric-based system significantly relies on a Hamming distance threshold which decides whether the errors in the query bit string will be rectified with reference to the template bit string. Kelkboom have recently modeled a basic framework to estimate the FAR and the FRR of one-bit biometric discretization. However, as the demand of a bit string with higher entropy (informative length) rises, single-bit discretization is getting less useful today due to its incapability of producing bit string that is longer than the total feature dimensions being extracted, thus causing Kelkboom's model to be of restricted use. In this paper, we extend the analytical framework to multibit discretization for estimating the performance and the decision threshold for achieving a specified FAR/FRR based on equal-probable quantization and linearly separable subcode encoding. Promising estimation results on a synthetic data set with independent feature components and Gaussian measurements vindicate the analytical expressions of our framework. However, for experiments on two popular face data sets, deviation in estimation results were obtained mainly due to the mismatch of independency assumption of our framework. We hence fit the analytical probability mass functions (pmfs) to the experimental pmfs through estimating the mean and the variance parameters from the difference between the corresponding analytical and experimental curves to alleviate such estimation inaccuracies on these data sets.",
author = "Lim, {Meng Hui} and Teoh, {Beng Jin}",
year = "2012",
month = "7",
day = "23",
doi = "10.1109/TIFS.2012.2191962",
language = "English",
volume = "7",
pages = "1242--1254",
journal = "IEEE Transactions on Information Forensics and Security",
issn = "1556-6013",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - An analytic performance estimation framework for multibit biometric discretization based on equal-probable quantization and linearly separable subcode encoding

AU - Lim, Meng Hui

AU - Teoh, Beng Jin

PY - 2012/7/23

Y1 - 2012/7/23

N2 - Biometric discretization derives a binary string for each user based on an ordered set of real-valued biometric features. The false acceptance rate (FAR) and the false rejection rate (FRR) of a binary biometric-based system significantly relies on a Hamming distance threshold which decides whether the errors in the query bit string will be rectified with reference to the template bit string. Kelkboom have recently modeled a basic framework to estimate the FAR and the FRR of one-bit biometric discretization. However, as the demand of a bit string with higher entropy (informative length) rises, single-bit discretization is getting less useful today due to its incapability of producing bit string that is longer than the total feature dimensions being extracted, thus causing Kelkboom's model to be of restricted use. In this paper, we extend the analytical framework to multibit discretization for estimating the performance and the decision threshold for achieving a specified FAR/FRR based on equal-probable quantization and linearly separable subcode encoding. Promising estimation results on a synthetic data set with independent feature components and Gaussian measurements vindicate the analytical expressions of our framework. However, for experiments on two popular face data sets, deviation in estimation results were obtained mainly due to the mismatch of independency assumption of our framework. We hence fit the analytical probability mass functions (pmfs) to the experimental pmfs through estimating the mean and the variance parameters from the difference between the corresponding analytical and experimental curves to alleviate such estimation inaccuracies on these data sets.

AB - Biometric discretization derives a binary string for each user based on an ordered set of real-valued biometric features. The false acceptance rate (FAR) and the false rejection rate (FRR) of a binary biometric-based system significantly relies on a Hamming distance threshold which decides whether the errors in the query bit string will be rectified with reference to the template bit string. Kelkboom have recently modeled a basic framework to estimate the FAR and the FRR of one-bit biometric discretization. However, as the demand of a bit string with higher entropy (informative length) rises, single-bit discretization is getting less useful today due to its incapability of producing bit string that is longer than the total feature dimensions being extracted, thus causing Kelkboom's model to be of restricted use. In this paper, we extend the analytical framework to multibit discretization for estimating the performance and the decision threshold for achieving a specified FAR/FRR based on equal-probable quantization and linearly separable subcode encoding. Promising estimation results on a synthetic data set with independent feature components and Gaussian measurements vindicate the analytical expressions of our framework. However, for experiments on two popular face data sets, deviation in estimation results were obtained mainly due to the mismatch of independency assumption of our framework. We hence fit the analytical probability mass functions (pmfs) to the experimental pmfs through estimating the mean and the variance parameters from the difference between the corresponding analytical and experimental curves to alleviate such estimation inaccuracies on these data sets.

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

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

U2 - 10.1109/TIFS.2012.2191962

DO - 10.1109/TIFS.2012.2191962

M3 - Article

VL - 7

SP - 1242

EP - 1254

JO - IEEE Transactions on Information Forensics and Security

JF - IEEE Transactions on Information Forensics and Security

SN - 1556-6013

IS - 4

M1 - 6175121

ER -