EnfoMax: Domain Entropy and Mutual Information Maximization for Domain Generalized Face Anti-spoofing

Tianyi Zheng
2/17/2023
cs.CV

No confident code implementation found for this paper.

Abstract

The face anti-spoofing (FAS) method performs well under intra-domain setups. However, its cross-domain performance is unsatisfactory. As a result, the domain generalization (DG) method has gained more attention in FAS. Existing methods treat FAS as a simple binary classification task and propose a heuristic training objective to learn domain-invariant features. However, there is no theoretical explanation of what a domain-invariant feature is. Additionally, the lack of theoretical support makes domain generalization techniques such as adversarial training lack training stability. To address these issues, this paper proposes the EnfoMax framework, which uses information theory to analyze cross-domain FAS tasks. This framework provides theoretical guarantees and optimization objectives for domain-generalized FAS tasks. EnfoMax maximizes the domain entropy and mutual information of live samples in source domains without using adversarial learning. Experimental results demonstrate that our approach performs well on extensive public datasets and outperforms state-of-the-art methods.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{zheng2023enfomax,
  title  = {EnfoMax: Domain Entropy and Mutual Information Maximization for Domain Generalized Face Anti-spoofing},
  author = {Tianyi Zheng},
  year   = {2023},
  eprint = {2302.08674},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.08674v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.08674.svg)](https://codeofpaper.com/paper/2302.08674)

Discussion