Improved Representation Learning for Unconstrained Face Recognition

Face recognition is a widely studied problem where the aim is to design a robust network that assigns higher similarity to the same face and reduces similarity between dissimilar faces. Previous research utilizing margin-based loss functions has achieved near-perfect accuracies on high-quality face recognition datasets. However, the same networks fail to perform well on low-quality images due to the degradation of facial attributes necessary for distinguishing different faces. In this paper, we tackle the problem of low-quality face recognition. We base our analysis on an observation that the change of loss functions produce marginal changes in performance for low-quality face recognition. Hence, rather than following the traditional approach of defining problem-specific regularized functions, we take a closer look at the nature of data in low resolution datasets and redefine paradigms in terms of model choice, data input pipeline and fine-tuning schemes. With the accumulated effect of all our design choices, we achieve state-of-the-art results in medium-quality benchmarks (IJB-B, IJB-C) as well as multiple challenging benchmarks for unconstrained face recognition (Tinyface, IJB-S and BRIAR), thereby opening up a new avenue of research in the area. The pretrained model are publically available in https://github.com/ Kartik-3004/PETALface

Authors

Institutions

Publication Details

Published
2025-05-26
DOI
https://doi.org/10.1109/fg61629.2025.11099270
Citations
1
Primary Topic
Face recognition and analysis
Type
article
Field-Weighted Citation Impact
1.28

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improved Representation Learning for Unconstrained Face Recognition

Vishal M. Patel, Jennifer Xu, Nathan Shnidman, Soraya Stevens et al.
1 citations
Face recognition and analysis
1.28
article

Improved Representation Learning for Unconstrained Face Recognition

Vishal M. Patel, Jennifer Xu, Nathan Shnidman, Soraya Stevens, Ram Prabhakar Kathirvel, Nithin Gopalakrishnan Nair, Joshua Gleason, Maitreya Suin, Rama Chellappa, Kartik Narayan
article en
1 citations

Abstract

Face recognition is a widely studied problem where the aim is to design a robust network that assigns higher similarity to the same face and reduces similarity between dissimilar faces. Previous research utilizing margin-based loss functions has achieved near-perfect accuracies on high-quality face recognition datasets. However, the same networks fail to perform well on low-quality images due to the degradation of facial attributes necessary for distinguishing different faces. In this paper, we tackle the problem of low-quality face recognition. We base our analysis on an observation that the change of loss functions produce marginal changes in performance for low-quality face recognition. Hence, rather than following the traditional approach of defining problem-specific regularized functions, we take a closer look at the nature of data in low resolution datasets and redefine paradigms in terms of model choice, data input pipeline and fine-tuning schemes. With the accumulated effect of all our design choices, we achieve state-of-the-art results in medium-quality benchmarks (IJB-B, IJB-C) as well as multiple challenging benchmarks for unconstrained face recognition (Tinyface, IJB-S and BRIAR), thereby opening up a new avenue of research in the area. The pretrained model are publically available in https://github.com/ Kartik-3004/PETALface

Johns Hopkins University (US), Systems and Technology Research (United States) (US)
Office of the Director of National Intelligence, Intelligence Advanced Research Projects Activity
Reduced inequalities
Openalex Percentile: Top 17%
Face recognition and analysis
1.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.