Spoofing-aware Prompt Learning for Unified Physical-Digital Facial Attack Detection

TL;DR

This paper introduces SPL-UAD, a novel framework that decouples physical and digital attack detection prompts, improving robustness and accuracy in face recognition security systems against diverse spoofing attacks.

Contribution

The paper proposes a spoofing-aware prompt learning framework with decoupled optimization and adaptive prompt generation for unified physical-digital attack detection.

Findings

Significant performance improvements on UniAttackDataPlus dataset.

Enhanced robustness against unseen attack types.

Effective decoupling of physical and digital attack prompts.

Abstract

Real-world face recognition systems are vulnerable to both physical presentation attacks (PAs) and digital forgery attacks (DFs). We aim to achieve comprehensive protection of biometric data by implementing a unified physical-digital defense framework with advanced detection. Existing approaches primarily employ CLIP with regularization constraints to enhance model generalization across both tasks. However, these methods suffer from conflicting optimization directions between physical and digital attack detection under same category prompt spaces. To overcome this limitation, we propose a Spoofing-aware Prompt Learning for Unified Attack Detection (SPL-UAD) framework, which decouples optimization branches for physical and digital attacks in the prompt space. Specifically, we construct a learnable parallel prompt branch enhanced with adaptive Spoofing Context Prompt Generation, enabling independent control of optimization for each attack type. Furthermore, we design a Cues-awareness Augmentation that leverages the dual-prompt mechanism to generate challenging sample mining tasks on data, significantly enhancing the model's robustness against unseen attack types. Extensive experiments on the large-scale UniAttackDataPlus dataset demonstrate that the proposed method achieves significant performance improvements in unified attack detection tasks.