Staff View: Cancellable face template algorithm based on speeded-up robust features and winner-takes-all

Cancellable face template algorithm based on speeded-up robust features and winner-takes-all

Features such as face, fingerprint, and iris imprints have been used for authentication in biometric system. The toughest feature amongst these is the face. Extracting a region with the most potential face features from an image for biometric identification followed by illumination enhancement is...

Full description

Saved in:

Bibliographic Details
Main Authors:	Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana
Format:	Article
Language:	English
Published:	Springer Nature 2020
Subjects:	QA75 Electronic computers. Computer science
Online Access:	http://repo.uum.edu.my/27850/1/MTA%20%2079%202020%2028675%2028693.pdf http://repo.uum.edu.my/27850/ http://doi.org/10.1007/s11042-020-09319-1
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my.uum.repo.27850
record_format	eprints
spelling	my.uum.repo.278502020-11-09T00:27:42Z http://repo.uum.edu.my/27850/ Cancellable face template algorithm based on speeded-up robust features and winner-takes-all Alwan, Hiba Basim Ku-Mahamud, Ku Ruhana QA75 Electronic computers. Computer science Features such as face, fingerprint, and iris imprints have been used for authentication in biometric system. The toughest feature amongst these is the face. Extracting a region with the most potential face features from an image for biometric identification followed by illumination enhancement is a commonly used method. However, the region of interest extraction followed by illumination enhancement is sensitive to image face feature displacement, skewed image, and bad illumination. This research presents a cancell able face image algorithm built upon the speeded-up robust features method to extract and select features. A speeded-up robust feature approach is utilised for the image’s features extraction, while Winner-Takes-All hashing is utilised for match-seeking. Finally, the features vectors are projected by utilising a random form of binary orthogonal matrice. Experiments were conducted on Yale and ORL datasets which provide gray scale images of sizes 168 × 192 and 112 × 92 pixels, respectively. The execution of the proposed algorithm was measured against several algorithms using equal error rate metric. It is found that the proposed algorithm produced an acceptable performance which indicates that this algorithm can be used in biometric security applications. Springer Nature 2020 Article PeerReviewed application/pdf en http://repo.uum.edu.my/27850/1/MTA%20%2079%202020%2028675%2028693.pdf Alwan, Hiba Basim and Ku-Mahamud, Ku Ruhana (2020) Cancellable face template algorithm based on speeded-up robust features and winner-takes-all. Multimedia Tools and Applications, 79. pp. 1-19. ISSN 1380-7501 http://doi.org/10.1007/s11042-020-09319-1 doi:10.1007/s11042-020-09319-1
institution	Universiti Utara Malaysia
building	UUM Library
collection	Institutional Repository
continent	Asia
country	Malaysia
content_provider	Universiti Utara Malaysia
content_source	UUM Institutional Repository
url_provider	http://repo.uum.edu.my/
language	English
topic	QA75 Electronic computers. Computer science
spellingShingle	QA75 Electronic computers. Computer science Alwan, Hiba Basim Ku-Mahamud, Ku Ruhana Cancellable face template algorithm based on speeded-up robust features and winner-takes-all
description	Features such as face, fingerprint, and iris imprints have been used for authentication in biometric system. The toughest feature amongst these is the face. Extracting a region with the most potential face features from an image for biometric identification followed by illumination enhancement is a commonly used method. However, the region of interest extraction followed by illumination enhancement is sensitive to image face feature displacement, skewed image, and bad illumination. This research presents a cancell able face image algorithm built upon the speeded-up robust features method to extract and select features. A speeded-up robust feature approach is utilised for the image’s features extraction, while Winner-Takes-All hashing is utilised for match-seeking. Finally, the features vectors are projected by utilising a random form of binary orthogonal matrice. Experiments were conducted on Yale and ORL datasets which provide gray scale images of sizes 168 × 192 and 112 × 92 pixels, respectively. The execution of the proposed algorithm was measured against several algorithms using equal error rate metric. It is found that the proposed algorithm produced an acceptable performance which indicates that this algorithm can be used in biometric security applications.
format	Article
author	Alwan, Hiba Basim Ku-Mahamud, Ku Ruhana
author_facet	Alwan, Hiba Basim Ku-Mahamud, Ku Ruhana
author_sort	Alwan, Hiba Basim
title	Cancellable face template algorithm based on speeded-up robust features and winner-takes-all
title_short	Cancellable face template algorithm based on speeded-up robust features and winner-takes-all
title_full	Cancellable face template algorithm based on speeded-up robust features and winner-takes-all
title_fullStr	Cancellable face template algorithm based on speeded-up robust features and winner-takes-all
title_full_unstemmed	Cancellable face template algorithm based on speeded-up robust features and winner-takes-all
title_sort	cancellable face template algorithm based on speeded-up robust features and winner-takes-all
publisher	Springer Nature
publishDate	2020
url	http://repo.uum.edu.my/27850/1/MTA%20%2079%202020%2028675%2028693.pdf http://repo.uum.edu.my/27850/ http://doi.org/10.1007/s11042-020-09319-1
_version_	1684655808420249600
score	13.211869

Cancellable face template algorithm based on speeded-up robust features and winner-takes-all

Similar Items