Emad Nabil

Dr. Emad Nabil

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
1 September 2016 in Expert Systems with Applications
Verified
Journal Article
Closed access
Emad NabilEmad Nabil
Emad Nabil

1 July 2016 in Pattern Recognition Letters
Verified
Journal Article
Closed access
SSSafinaz AbdEl-Fattah Sayed
Safinaz AbdEl-Fattah Sayed
Emad NabilEmad Nabil
Emad Nabil
ABAmr Badr
Amr Badr

27 April 2021 in IEEE Access
Verified
Journal Article
Open access
Essam Halim HousseinEssam Halim Houssein
Essam Halim Houssein
DSDiaa Salama
Diaa Salama
HHHager N. Hassan
Hager N. Hassan
MAMustafa M. Al-Sayed
Mustafa M. Al-Sayed
Emad NabilEmad Nabil
Emad Nabil
These days, the classification between normal and cancerous tissues and between different types of cancers represents a very important issue. Selecting the little informative number of genes is considered the main challenge in the cancer diagnosis issue. Therefore, Gene selection is usually the preliminary step for solving the cancer classification problems. Bio-inspired metaheuristic optimization algorithms, when used to solve gene selection and classification problems, they demonstrate their effectiveness. Barnacles Mating Optimizer (BMO) algorithm, which imitates the behavior of mating barnacles in nature for solving optimization problems, is considered one of these algorithms. In this paper, Barnacles Mating Optimizer (BMO) algorithm augmented with Support Vector Machines (SVM) called BMO-SVM is proposed for a microarray gene expression profiling in order to select the most predictive and informative genes for cancer classification. Conducting a comparative experimental study among a set of the most common bio-inspired optimization techniques to specify the most effective. A binary microarray dataset (i.e., leukemia1) and a multi-class microarray dataset (i.e., SRBCT, lymphoma, and leukemia2) are used for testing the performance of the proposed model. The experimental results revealed the superiority of the proposed BMO-SVM approach against several well-known meta-heuristic optimization algorithms, such as the Tunicate Swarm Algorithm (TSA), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Artificial Bee Colony (ABC). It is worth mentioning that our proposed algorithm achieves a high informational superiority percentage compared to other algorithms.

1 January 2019 in International Journal of Advanced Computer Science and Applications
Verified
Journal Article
Open access
PDF file
MTMohamed Ebrahim Torky
Mohamed Ebrahim Torky
Emad NabilEmad Nabil
Emad Nabil
WMwael said abdelmageed Mohamed
wael said abdelmageed Mohamed
Rumors and misleading information detection and prevention still represent a big challenge against social network developers and researchers. Since newsworthy information propagation is a traditional behavior of most of the users in social media, then verifying information credibility and reliability is indeed a vital security requirement for social network platforms. Due to its immutability, security, tamper-proof and P2P design, Blockchain as a powerful technology can provide a magical solution to overcome this challenge. This Paper introduces a novel blockchain approach called Proof of Credibility (PoC) for detecting fake news and blocking its propagation in social networks. The functionality of the PoC protocol has been simulated on two datasets of newsworthy tweets collected from different news sources on Twitter. The results clarified a satisfying performance and efficiency of the proposed approach in detecting rumors and blocking its propagation.

1 June 2020 in IEEE Access
Verified
Journal Article
Open access
MAMohamed Abdelmaksoud
Mohamed Abdelmaksoud
Emad NabilEmad Nabil
Emad Nabil
IFIbrahim Farag
Ibrahim Farag
HHHala Abdel Hameed
Hala Abdel Hameed
Face Recognition (FR) problem is one of the significant fields in computer vision. FR is used to identify the faces that appear over distributed cameras over the network. The problem of face recognition can be divided into two categories, the first is recognition with more than one sample per person, which can be called traditional face recognition problem. The second is the recognition of faces using only a Single Sample Per Person (SSPP). The efficiency of face recognition systems decreases because of limited references especially (SSPP) and faces taken in the Operational Domain (OD) different from faces in the Enrollment Domain (ED) in illumination, pose, low-resolution, and blurriness. This paper proposed a method that deals with all problems related to face recognition with SSPP. 3D face reconstruction is used to increase the reference gallery set with different poses and generate a design domain dictionary to overcome the problem of limited reference. Besides, the design domain dictionary is used to feed different deep learning models. Face illumination transfer techniques are utilized to overcome the illumination problem. Labeled Faces in theWild (LFW) dataset is used to train Super-Resolution Generative Adversarial Network (SRGAN) to overcome the low-resolution problem. Deblur Generative Adversarial Network (DeblurGAN) is trained on the LFW dataset to overcome the problem of blurriness. The proposed method is evaluated using the Chokepoint dataset and COX-S2V dataset. The final results confirm an overall enhancement in accuracy compared to techniques that use SSPP for face recognition (generic learning and face synthesizing approaches). Also, the proposed method outperforms of Traditional and Deep Learning (TDL) method accuracy, which uses SSPP for face recognition.

1 August 2020 in Building and Environment
Verified
Journal Article
Closed access
HIHamada Ibrhim
Hamada Ibrhim
SKSherif Khattab
Sherif Khattab
KEKhaled Elsayed
Khaled Elsayed
ABAmr Badr
Amr Badr
Emad NabilEmad Nabil
Emad Nabil