paper-with-me

Papers

Age-Invariant Face Embedding using the Wasserstein Distance

2023-05-04 · Eran Dahan, Yosi Keller

In this work, we study face verification in datasets where images of the same individuals exhibit significant age differences. This poses a major challenge for current face recognition and verification techniques. To address this issue, we propose a novel approach that utilizes multitask learning and a Wasserstein distance discriminator to disentangle age and identity embeddings of facial images. Our approach employs multitask learning with a Wasserstein distance discriminator that minimizes the mutual information between the age and identity embeddings by minimizing the Jensen-Shannon divergence. This improves the encoding of age and identity information in face images and enhances the performance of face verification in age-variant datasets. We evaluate the effectiveness of our approach using multiple age-variant face datasets and demonstrate its superiority over state-of-the-art methods in terms of face verification accuracy.

📄 PDF Abstract BibTeX arXiv:2305.02745

Code (0)

등록된 구현이 없습니다.

Tasks

Face RecognitionFace Verification

Similar Papers 제목 키워드 기반

Wasserstein CNN: Learning Invariant Features for NIR-VIS Face Recognition

2017-08-08 · Ran He, Xiang Wu, Zhenan Sun, Tieniu Tan

Heterogeneous face recognition (HFR) aims to match facial images acquired from different sensing modalities with mission-critical applications in forensics, security and commercial sectors. However, HFR is a much more ch…

Face RecognitionHeterogeneous Face Recognition

Wasserstein Distance Guided Representation Learning for Domain Adaptation

2017-07-05 · Jian Shen, Yanru Qu, Wei-Nan Zhang, Yong Yu

Domain adaptation aims at generalizing a high-performance learner on a target domain via utilizing the knowledge distilled from a source domain which has a different but related data distribution. One solution to domain …

Domain AdaptationGeneral Classificationimage-classificationImage Classification+1

Permutation invariant networks to learn Wasserstein metrics

2020-10-12 · NeurIPS Workshop TDA_and_Beyond 2020 12 · Arijit Sehanobish, Neal Ravindra, David van Dijk

Understanding the space of probability measures on a metric space equipped with a Wasserstein distance is one of the fundamental questions in mathematical analysis. The Wasserstein metric has received a lot of attention …

Generating valid Euclidean distance matrices

2019-10-07 · Moritz Hoffmann, Frank Noé

Generating point clouds, e.g., molecular structures, in arbitrary rotations, translations, and enumerations remains a challenging task. Meanwhile, neural networks utilizing symmetry invariant layers have been shown to be…

Translationvalid

Point Cloud Classification via Deep Set Linearized Optimal Transport

2024-01-02 · Scott Mahan, Caroline Moosmüller, Alexander Cloninger

We introduce Deep Set Linearized Optimal Transport, an algorithm designed for the efficient simultaneous embedding of point clouds into an $L^2-$space. This embedding preserves specific low-dimensional structures within …

ClassificationPoint Cloud Classification