EFaR 2023: Efficient Face Recognition Competition
- URL: http://arxiv.org/abs/2308.04168v1
- Date: Tue, 8 Aug 2023 09:58:22 GMT
- Title: EFaR 2023: Efficient Face Recognition Competition
- Authors: Jan Niklas Kolf, Fadi Boutros, Jurek Elliesen, Markus Theuerkauf,
Naser Damer, Mohamad Alansari, Oussama Abdul Hay, Sara Alansari, Sajid Javed,
Naoufel Werghi, Klemen Grm, Vitomir \v{S}truc, Fernando Alonso-Fernandez,
Kevin Hernandez Diaz, Josef Bigun, Anjith George, Christophe Ecabert, Hatef
Otroshi Shahreza, Ketan Kotwal, S\'ebastien Marcel, Iurii Medvedev, Bo Jin,
Diogo Nunes, Ahmad Hassanpour, Pankaj Khatiwada, Aafan Ahmad Toor, Bian Yang
- Abstract summary: The paper presents the summary of the Efficient Face Recognition Competition (EFaR) held at the 2023 International Joint Conference on Biometrics (IJCB 2023)
The competition received 17 submissions from 6 different teams.
The submitted solutions are ranked based on a weighted score of the achieved verification accuracies on a diverse set of benchmarks, as well as the deployability given by the number of floating-point operations and model size.
- Score: 51.77649060180531
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: This paper presents the summary of the Efficient Face Recognition Competition
(EFaR) held at the 2023 International Joint Conference on Biometrics (IJCB
2023). The competition received 17 submissions from 6 different teams. To drive
further development of efficient face recognition models, the submitted
solutions are ranked based on a weighted score of the achieved verification
accuracies on a diverse set of benchmarks, as well as the deployability given
by the number of floating-point operations and model size. The evaluation of
submissions is extended to bias, cross-quality, and large-scale recognition
benchmarks. Overall, the paper gives an overview of the achieved performance
values of the submitted solutions as well as a diverse set of baselines. The
submitted solutions use small, efficient network architectures to reduce the
computational cost, some solutions apply model quantization. An outlook on
possible techniques that are underrepresented in current solutions is given as
well.
Related papers
- LLaMA-Berry: Pairwise Optimization for O1-like Olympiad-Level Mathematical Reasoning [56.273799410256075]
The framework combines Monte Carlo Tree Search (MCTS) with iterative Self-Refine to optimize the reasoning path.
The framework has been tested on general and advanced benchmarks, showing superior performance in terms of search efficiency and problem-solving capability.
arXiv Detail & Related papers (2024-10-03T18:12:29Z) - The Robust Semantic Segmentation UNCV2023 Challenge Results [99.97867942388486]
This paper outlines the winning solutions employed in addressing the MUAD uncertainty quantification challenge held at ICCV 2023.
The challenge was centered around semantic segmentation in urban environments, with a particular focus on natural adversarial scenarios.
The report presents the results of 19 submitted entries, with numerous techniques drawing inspiration from cutting-edge uncertainty quantification methodologies.
arXiv Detail & Related papers (2023-09-27T08:20:03Z) - Comparison of classifiers in challenge scheme [12.030094148004176]
This paper analyzes the results of the MeOffendEs@IberLEF 2021 competition.
It proposes to make inference through resampling techniques (bootstrap) to support Challenge organizers' decision-making.
arXiv Detail & Related papers (2023-05-16T23:38:34Z) - A portfolio-based analysis method for competition results [0.8680676599607126]
I will describe a portfolio-based analysis method which can give complementary insights into the performance of participating solvers in a competition.
The method is demonstrated on the results of the MiniZinc Challenges and new insights gained from the portfolio viewpoint are presented.
arXiv Detail & Related papers (2022-05-30T20:20:45Z) - Quality-Aware Multimodal Biometric Recognition [30.322429033099688]
We develop a quality-aware framework for fusing representations of input modalities by weighting their importance using quality scores estimated in a weakly-supervised fashion.
This framework utilizes two fusion blocks, each represented by a set of quality-aware and aggregation networks.
We evaluate the performance by considering three multimodal datasets consisting of face, iris, and fingerprint modalities.
arXiv Detail & Related papers (2021-12-10T20:48:55Z) - MFR 2021: Masked Face Recognition Competition [43.60381669339876]
The competition attracted a total of 10 participating teams with valid submissions.
The affiliations of these teams are diverse and associated with academia and industry in nine different countries.
The competition is designed to motivate solutions aiming at enhancing the face recognition accuracy of masked faces.
arXiv Detail & Related papers (2021-06-29T11:59:56Z) - ICDAR 2021 Competition on Components Segmentation Task of Document
Photos [63.289361617237944]
Three challenge tasks were proposed entailing different segmentation assignments to be performed on a provided dataset.
The collected data are from several types of Brazilian ID documents, whose personal information was conveniently replaced.
Different Deep Learning models were applied by the entrants with diverse strategies to achieve the best results in each of the tasks.
arXiv Detail & Related papers (2021-06-16T00:49:58Z) - AR-Net: Adaptive Frame Resolution for Efficient Action Recognition [70.62587948892633]
Action recognition is an open and challenging problem in computer vision.
We propose a novel approach, called AR-Net, that selects on-the-fly the optimal resolution for each frame conditioned on the input for efficient action recognition.
arXiv Detail & Related papers (2020-07-31T01:36:04Z) - Recognizing Families In the Wild: White Paper for the 4th Edition Data
Challenge [91.55319616114943]
This paper summarizes the supported tasks (i.e., kinship verification, tri-subject verification, and search & retrieval of missing children) in the Recognizing Families In the Wild (RFIW) evaluation.
The purpose of this paper is to describe the 2020 RFIW challenge, end-to-end, along with forecasts in promising future directions.
arXiv Detail & Related papers (2020-02-15T02:22:42Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.