Unknown Presentation Attack Detection against Rational Attackers
Ali Khodabakhsh, Zahid Akhtar

TL;DR
This paper introduces a game-theoretic approach with a novel generator-based detection technique and C-marmax loss to improve presentation attack detection, especially against unknown and rational attackers, with enhanced explainability and few-shot learning.
Contribution
It proposes a new optimization framework, a generator-based feature set, and a C-marmax loss function to enhance detection of both known and unknown attacks in adversarial settings.
Findings
Achieves state-of-the-art detection performance for known and unknown attacks.
Provides balanced performance across attack types and settings.
Demonstrates potential for few-shot learning and pixel-level explainability.
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 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 modeling the interactions between the attacker and the detector. Consequently, a new optimization 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 optimize the performance on known attacks, a new loss…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
