Mayad Tarek

Dr. Mayad Tarek


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2016 in IET Biometrics
Verified
Journal Article
Open access
PDF file
MTMayad Tarek
Mayad Tarek
Osama OudaOsama Ouda
Osama Ouda
THTaher Hamza
Taher Hamza
Several cancellable biometrics (CBs) techniques have been proposed to protect biometric data and maintain users’ privacy. Although such techniques can withstand brute‐force and/or pre‐image attacks, they are vulnerable to correlation attacks. In this study, the authors propose a novel correlation attack‐resistant CBs scheme that is based on a convolution operation and a bidirectional associative memory (BAM) neural network. The proposed scheme utilises BAM to bind biometric templates to random bit‐strings in a secure and efficient manner. These random bit‐strings are then employed to derive cancellable templates from the true templates linked to them via BAM weights, which are safely stored with the generated cancellable template in the system database. In this study, linear convolution is adopted as the cancellable transformation process. The result of convolving the original biometric template with the transformation key is binarised according to a predefined threshold to thwart blind de‐convolution. The security of the proposed scheme against different attacks is analysed and experiments on the CASIA‐IrisV3‐Interval dataset illustrate the efficacy of the proposed scheme.

4 May 2021 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
MTMayad Tarek
Mayad Tarek
EHEslam Hamouda
Eslam Hamouda
AAAbdelaziz Abohamama
Abdelaziz Abohamama

3 May 2018 in PLOS ONE
Verified
Journal Article
Open access
PDF file
PFProf. Islam Foad
Prof. Islam Foad
SESara El-Metwally
Sara El-Metwally
MTMayad Tarek
Mayad Tarek
The kidney exchange programs bring new insights in the field of organ transplantation. They make the previously not allowed surgery of incompatible patient-donor pairs easier to be performed on a large scale. Mathematically, the kidney exchange is an optimization problem for the number of possible exchanges among the incompatible pairs in a given pool. Also, the optimization modeling should consider the expected quality-adjusted life of transplant candidates and the shortage of computational and operational hospital resources. In this article, we introduce a bio-inspired stochastic-based Ant Lion Optimization, ALO, algorithm to the kidney exchange space to maximize the number of feasible cycles and chains among the pool pairs. Ant Lion Optimizer-based program achieves comparable kidney exchange results to the deterministic-based approaches like integer programming. Also, ALO outperforms other stochastic-based methods such as Genetic Algorithm in terms of the efficient usage of computational resources and the quantity of resulting exchanges. Ant Lion Optimization algorithm can be adopted easily for on-line exchanges and the integration of weights for hard-to-match patients, which will improve the future decisions of kidney exchange programs. A reference implementation for ALO algorithm for kidney exchanges is written in MATLAB and is GPL licensed. It is available as free open-source software from: https://github.com/SaraEl-Metwally/ALO_algorithm_for_Kidney_Exchanges.

11 March 2021 in Arabian Journal for Science and Engineering
Verified
Journal Article
Closed access
PDF file
PFProf. Islam Foad
Prof. Islam Foad
AAAbdelaziz Abohamama
Abdelaziz Abohamama
MTMayad Tarek
Mayad Tarek

28 December 2025 in Sensors
Verified
Journal Article
Open access
PDF file
PFProf. Islam Foad
Prof. Islam Foad
AAAlaa Alaerjan
Alaa Alaerjan
Ayman Mohamed MostafaAyman Mohamed Mostafa
Ayman Mohamed Mostafa
MTMayad Tarek
Mayad Tarek
Score fusion is a technique that combines the matching scores from multiple biometric modalities for an authentication system. Biometric modalities are unique physical or behavioral characteristics that can be used to identify individuals. Biometric authentication systems use these modalities to verify or identify individuals. Score fusion can improve the performance of biometric authentication systems by exploiting the complementary strengths of different modalities and reducing the impact of noise and outliers from individual modalities. This paper proposes a new score fusion method based on the Sine Cosine Algorithm (SCA). SCA is a meta-heuristic optimization algorithm used in various optimization problems. The proposed method extracts features from multiple biometric sources and then computes intra/inter scores for each modality. The proposed method then normalizes the scores for a given user using different biometric modalities. Then, the mean, maximum, minimum, median, summation, and Tanh are used to aggregate the scores from different biometric modalities. The role of the SCA is to find the optimal parameters to fuse the normalized scores. We evaluated our methods on the CASIA-V3-Internal iris dataset and the AT&T (ORL) face database. The proposed method outperforms existing optimization-based methods under identical experimental conditions and achieves an Equal Error Rate (EER) of 1.003% when fusing left iris, right iris, and face. This represents an improvement of up to 85.89% over unimodal baselines. These findings validate SCA’s effectiveness for adaptive score fusion in multimodal biometric systems.

11 August 2021 in Current Bioinformatics
Verified
Journal Article
Closed access
PDF file
SESara El-Metwally
Sara El-Metwally
PFProf. Islam Foad
Prof. Islam Foad
MTMayad Tarek
Mayad Tarek
The assembly evaluation process is the starting step towards meaningful downstream data analysis. We need to know how much accurate information is included in an assembled sequence before going further to any data analysis stage. Four basic metrics are targeted by different assembly evaluation tools: contiguity, accuracy, completeness, and contamination. Some tools evaluate these metrics based on comparing the assembly results to a closely related reference. Others utilize different types of heuristics to overcome the missing of a guiding reference, such as the consistency between assembly results and sequencing reads. In this paper, we discuss the assembly evaluation process as a core stage in any sequence assembly pipeline and present a roadmap that is followed by most assembly evaluation tools to assess different metrics. We highlight the challenges that currently exist in the assembly evaluation tools and summarize their technical and practical details to help the end-users choose the best tool according to their working scenarios. To address the similarities/differences among different assembly assessment tools, including their evaluation approaches, metrics, comprehensive nature, limitations, usability and how the evaluated results are presented to the end-user, we provide a practical example for evaluating Velvet assembly results for S. aureus dataset from GAGE competition. A Github repository (https://github.com/SaraEl-Metwally/Assembly-Evaluation-Tools) is created for evaluation result details along with their generated command line parameters.