Matrix-Regularized One-Class Multiple Kernel Learning for Unseen Face Presentation Attack Detection

Shervin Rahimzadeh Arashloo

doi:10.1109/TIFS.2021.3111766

Return

Matrix-Regularized One-Class Multiple Kernel Learning for Unseen Face Presentation Attack Detection

2021-01-01

PRE

Shervin Rahimzadeh Arashloo *

DOI：10.1109/TIFS.2021.3111766

Original

Original request for help

Save

Abstract

En 中文

The functionality of face biometric systems is severely challenged by presentation attacks (PA's), and especially those attacks that have not been available during the training phase of a PA detection (PAD) subsystem. Among other alternatives, the one-class classification (OCC) paradigm is an applicable strategy that has been observed to provide good generalisation against unseen attacks. Following an OCC approach for the unseen face PAD from RGB images, this work advocates a matrix-regularised multiple kernel learning algorithm to make use of several sources of information each constituting a different view of the face PAD problem. In particular, drawing on the one-class null Fisher classification principle, we characterise different deep CNN representations as kernels and propose a multiple kernel learning (MKL) algorithm subject to an (r, p)-norm (1 <= r, p) matrix regularisation constraint. The propose MKL algorithm is formulated as a saddle point Lagrangian optimisation task for which we present an effective optimisation algorithm with guaranteed convergence. An evaluation of the proposed one-class MKL algorithm on both general object images in an OCC setting as well as on different face PAD datasets in an unseen zero-shot attack detection setting illustrates the merits of the proposed method compared to other one-class multiple kernel and deep end-to-end CNN-based methods.

Keywords:

Unseen face presentation attack detection

one-class Fisher null projection

multiple kernel learning

matrix regularisation

zero-shot learning