Unknown presentation attack detection against rational attackers
Abstract Despite the impressive progress in the field of presentation attack detection and multimedia forensics over the last decade, these systems are still vulnerable to attacks in real‐life settings. Some of the challenges for the existing solutions are the detection of unknown attacks, the abili...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-09-01
|
| Series: | IET Biometrics |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/bme2.12053 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Abstract Despite the impressive progress in the field of presentation attack detection and multimedia forensics over the last decade, these systems are still vulnerable to attacks in real‐life settings. Some of the challenges for the existing solutions are the detection of unknown attacks, the ability to perform in adversarial settings, few‐shot learning, and explainability. In this study, these limitations are approached by reliance on a game‐theoretic view for modelling the interactions between the attacker and the detector. Consequently, a new optimisation criterion is proposed and a set of requirements are defined for improving the performance of these systems in real‐life settings. Furthermore, a novel detection technique is proposed using generator‐based feature sets that are not biased towards any specific attack species. To further optimise the performance on known attacks, a new loss function coined categorical margin maximisation loss (C‐marmax) is proposed, which gradually improves the performance against the most powerful attack. The proposed approach provides a more balanced performance across known and unknown attacks and achieves state‐of‐the‐art performance in known and unknown attack detection cases against rational attackers. Lastly, the few‐shot learning potential of the proposed approach as well as its ability to provide pixel‐level explainability is studied. |
|---|---|
| ISSN: | 2047-4938 2047-4946 |