Consistency Regularization for Deep Face Anti-Spoofing

被引:9
|
作者
Wang, Zezheng [1 ]
Yu, Zitong [2 ]
Wang, Xun [1 ]
Qin, Yunxiao [3 ]
Li, Jiahong [1 ]
Zhao, Chenxu [4 ]
Liu, Xin [5 ]
Lei, Zhen [6 ]
机构
[1] Kuaishou Technol, MMU, Beijing, Peoples R China
[2] Great Bay Univ, Guangzhou, Peoples R China
[3] Commun Univ China, State Key Lab Media Convergence & Commun, Beijing, Peoples R China
[4] SailYond Technol, Beijing, Peoples R China
[5] Lappeenranta Lahti Univ Technol LUT, Comp Vis & Pattern Recognit Lab, Lappeenranta, Finland
[6] Chinese Acad Sci CASIA, Inst Automation, Ctr Biometr & Secur Res CBSR, Natl Lab Pattern Recognit NLPR, Beijing, Peoples R China
关键词
Face recognition; Faces; Task analysis; Training; Benchmark testing; Supervised learning; Protocols; Face anti-spoofing; consistency regularization; semi-supervised learning;
D O I
10.1109/TIFS.2023.3235581
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Face anti-spoofing (FAS) plays a crucial role in securing face recognition systems. Empirically, given an image, a model with more consistent output on different views (i.e., augmentations) of this image usually performs better. Motivated by this exciting observation, we conjecture that encouraging feature consistency of different views may be a promising way to boost FAS models. In this paper, we explore this way thoroughly by enhancing both Embedding-level and Prediction-level Consistency Regularization (EPCR) in FAS. Specifically, at the embedding level, we design a dense similarity loss to maximize the similarities between all positions of two intermediate feature maps in a self-supervised fashion; while at the prediction level, we optimize the mean square error between the predictions of two views. Notably, our EPCR is free of annotations and can directly integrate into semi-supervised learning schemes. Considering different application scenarios, we further design five diverse semi-supervised protocols to measure semi-supervised FAS techniques. We conduct extensive experiments to show that EPCR can significantly improve the performance of several supervised and semi-supervised tasks on benchmark datasets.
引用
收藏
页码:1127 / 1140
页数:14
相关论文
共 50 条
  • [41] Face Anti-Spoofing using Haralick Features
    Agarwal, Akshay
    Singh, Richa
    Vatsa, Mayank
    2016 IEEE 8TH INTERNATIONAL CONFERENCE ON BIOMETRICS THEORY, APPLICATIONS AND SYSTEMS (BTAS), 2016,
  • [42] Face anti-spoofing with Image Quality Assessment
    Fourati, Emna
    Elloumi, Wael
    Chetouani, Aladine
    2017 2ND INTERNATIONAL CONFERENCE ON BIO-ENGINEERING FOR SMART TECHNOLOGIES (BIOSMART), 2017,
  • [44] A Robust Method with DropBlock for Face Anti-Spoofing
    Wu, Gang
    Zhou, Zhuo
    Guo, Zhenhua
    2021 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2021,
  • [45] Face Anti-spoofing based on Sharpness Profiles
    Karthik, Kannan
    Katika, Balaji Rao
    2017 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL AND INFORMATION SYSTEMS (ICIIS), 2017, : 123 - 128
  • [46] Face Anti-spoofing: A Comparative Review and Prospects
    Kim W.
    IEIE Transactions on Smart Processing and Computing, 2021, 10 (06): : 455 - 463
  • [47] Face Anti-Spoofing with Multifeature Videolet Aggregation
    Siddiqui, Talha Ahmad
    Bharadwaj, Samarth
    Dhamecha, Tejas I.
    Agarwal, Akshay
    Vatsa, Mayank
    Singh, Richa
    Ratha, Nalini
    2016 23RD INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2016, : 1035 - 1040
  • [48] Advanced Face Anti-Spoofing with Depth Segmentation
    Zhang, Licheng
    Sun, Nan
    Wu, Xihong
    Luo, Dingsheng
    2022 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2022,
  • [49] ONLINE ADAPTIVE PERSONALIZATION FOR FACE ANTI-SPOOFING
    Belli, Davide
    Das, Debasmit
    Major, Bence
    Porikli, Fatih
    2022 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, ICIP, 2022, : 351 - 355
  • [50] Generative Domain Adaptation for Face Anti-Spoofing
    Zhou, Qianyu
    Zhang, Ke-Yue
    Yao, Taiping
    Yi, Ran
    Sheng, Kekai
    Ding, Shouhong
    Ma, Lizhuang
    COMPUTER VISION - ECCV 2022, PT V, 2022, 13665 : 335 - 356