Privacy-Protected Facial Biometric Verification Using Fuzzy Forest Learning

被引:20
作者
Jiang, Richard [1 ]
Bouridane, Ahmed [1 ]
Crookes, Danny [2 ]
Celebi, M. Emre [3 ]
Wei, Hua-Liang [4 ]
机构
[1] Northumbria Univ, Dept Comp Sci & Digital Technol, Newcastle Upon Tyne NE1 8ST, Tyne & Wear, England
[2] Queens Univ Belfast, Sch Elect Elect Engn & Comp Sci, Inst Elect Commun & Informat Technol, Belfast BT3 9DT, Antrim, North Ireland
[3] Louisiana State Univ, Dept Comp Sci, Shreveport, LA 71115 USA
[4] Univ Sheffield, Dept Automat Control & Syst Engn, Sheffield S10 2TN, S Yorkshire, England
基金
英国工程与自然科学研究理事会;
关键词
Chaotic pattern; ensemble learning; face scrambling; facial biometrics; fuzzy random forest; privacy; FACE RECOGNITION; EIGENFACES; DESIGN; VIDEOS;
D O I
10.1109/TFUZZ.2015.2486803
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Although visual surveillance has emerged as an effective technolody for public security, privacy has become an issue of great concern in the transmission and distribution of surveillance videos. For example, personal facial images should not be browsed without permission. To cope with this issue, face image scrambling has emerged as a simple solution for privacy-related applications. Consequently, online facial biometric verification needs to be carried out in the scrambled domain, thus bringing a new challenge to face classification. In this paper, we investigate face verification issues in the scrambled domain and propose a novel scheme to handle this challenge. In our proposed method, to make feature extraction from scrambled face images robust, a biased random subspace sampling scheme is applied to construct fuzzy decision trees from randomly selected features, and fuzzy forest decision using fuzzy memberships is then obtained from combining all fuzzy tree decisions. In our experiment, we first estimated the optimal parameters for the construction of the random forest and, then, applied the optimized model to the benchmark tests using three publically available face datasets. The experimental results validated that our proposed scheme can robustly cope with the challenging tests in the scrambled domain and achieved an improved accuracy over all tests, making our method a promising candidate for the emerging privacy-related facial biometric applications.
引用
收藏
页码:779 / 790
页数:12
相关论文
共 50 条
[1]  
[Anonymous], P C COMP VIS PATT RE
[2]   Eigenfaces vs. Fisherfaces: Recognition using class specific linear projection [J].
Belhumeur, PN ;
Hespanha, JP ;
Kriegman, DJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (07) :711-720
[3]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[4]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[5]  
Breiman L, 1998, ANN STAT, V26, P801
[6]  
Cai D, 2007, 20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P714
[7]   Efficient leave-one-out cross-validation of kernel Fisher discriminant classifiers [J].
Cawley, GC ;
Talbot, NLC .
PATTERN RECOGNITION, 2003, 36 (11) :2585-2592
[8]   Improving Face Recognition via Narrowband Spectral Range Selection Using Jeffrey Divergence [J].
Chang, Hong ;
Yao, Yi ;
Koschan, Andreas ;
Abidi, Besma ;
Abidi, Mongi .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2009, 4 (01) :111-122
[9]   Active appearance models [J].
Cootes, TF ;
Edwards, GJ ;
Taylor, CJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (06) :681-685
[10]   Continuous Pose Normalization for Pose-Robust Face Recognition [J].
Ding, Liu ;
Ding, Xiaoqing ;
Fang, Chi .
IEEE SIGNAL PROCESSING LETTERS, 2012, 19 (11) :721-724