Please use this identifier to cite or link to this item: https://doi.org/10.1109/ICIP.2005.1530509
DC FieldValue
dc.titleGeneralized optimal thresholding for biometric key generation using face images
dc.contributor.authorZhang W.
dc.contributor.authorChen T.
dc.date.accessioned2018-08-21T05:09:21Z
dc.date.available2018-08-21T05:09:21Z
dc.date.issued2005
dc.identifier.citationZhang W., Chen T. (2005). Generalized optimal thresholding for biometric key generation using face images. Proceedings - International Conference on Image Processing, ICIP 3 : 784-787. ScholarBank@NUS Repository. https://doi.org/10.1109/ICIP.2005.1530509
dc.identifier.isbn0780391349
dc.identifier.isbn9780780391345
dc.identifier.issn15224880
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/146302
dc.description.abstractIn this paper, we study biometric key generation using face images. Given a face image, a set of biometric features are extracted. Each feature is compared with a threshold to generate a key-bit. By cascading the key-bits from all the features, we obtain one bio-key that can be used for security applications. The performance of a biometric key generation system, determined by the chosen thresholds, can be evaluated according to reliability and security. A generalized optimal thresholding method is proposed in this paper to improve the reliability by minimizing the authentication error rate and the security by maximizing the entropy of the generated key.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentOFFICE OF THE PROVOST
dc.contributor.departmentDEPARTMENT OF COMPUTER SCIENCE
dc.description.doi10.1109/ICIP.2005.1530509
dc.description.sourcetitleProceedings - International Conference on Image Processing, ICIP
dc.description.volume3
dc.description.page784-787
dc.published.statepublished
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.