Hayder Saadi Radeaf

Dr. Hayder Saadi Radeaf

Computer Engineering Department, Unversity of Baghdad/College of Engineering, Baghdad, Baghdād, Iraq
orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
15 April 2019
Verified
Conference Paper
Open access
PDF file
Hayder Saadi RadeafHayder Saadi Radeaf
Hayder Saadi Radeaf
BMBasheera M. Mahmmod
Basheera M. Mahmmod
SASadiq H. Abdulhussain
Sadiq H. Abdulhussain
DADhyia Al-Jumaeily
Dhyia Al-Jumaeily

15 December 2023 in Iraqi Journal of Information and Communication Technology
Verified
Journal Article
Open access
PDF file
Hayder Saadi RadeafHayder Saadi Radeaf
Hayder Saadi Radeaf
MAMohammed Z. Al-Faiz
Mohammed Z. Al-Faiz
This work implements an Electroencephalogram (EEG) signal classifier. The implemented method uses Orthogonal Polynomials (OP) to convert the EEG signal samples to moments. A Sparse Filter (SF) reduces the number of converted moments to increase the classification accuracy. A Support Vector Machine (SVM) is used to classify the reduced moments between two classes. The proposed method’s performance is tested and compared with two methods by using two datasets. The datasets are divided into 80% for training and 20% for testing, with 5 -fold used for cross-validation. The results show that this method overcomes the accuracy of other methods. The proposed method’s best accuracy is 95.6% and 99.5%, respectively. Finally, from the results, it is obvious that the number of moments selected by the SP should exceed 30% of the overall EEG samples for accuracy to be over 90%.

18 September 2013 in International Journal of Computer Applications
Verified
Journal Article
Open access
SHSadiq H.Abdulhussain
Sadiq H.Abdulhussain
Hayder Saadi RadeafHayder Saadi Radeaf
Hayder Saadi Radeaf
BMBasheera M. Mahmood
Basheera M. Mahmood

30 March 2026 in Al-Qadisiyah Journal for Engineering Sciences
Verified
Journal Article
Open access
PDF file
Hayder Saadi RadeafHayder Saadi Radeaf
Hayder Saadi Radeaf
AAaljobouri Aljobouri
aljobouri Aljobouri
NANoor Kathem Al-Waely
Noor Kathem Al-Waely
OAOktay ALGIN
Oktay ALGIN
Assessment of bone age, which represents the development and maturity of bones. It helps treat various pediatric conditions and address legal issues. Conventional bone age assessment is a complex and laborious procedure that is susceptible to inconsistencies between different reviewers and within the same reviewer. Artificial intelligence is a new automatic, accurate, and fast method used to evaluate bone age from X-ray images. In this work, a new network design based on AI methods is proposed. This network is based on the dataset obtained from the Paediatric Bone Age Challenge organized by the Radiological Society of North America. The collection comprises 12,600 radiological pictures of left hands, each labeled with the patient's bone age and sex. The design involves two steps: first, using a Faster R-CNN mask by training the ResNet50 model to select regions of interest and then entering the selected regions into three models (Inception v3, GoogleNet, and ResNet50) for regression-based bone age estimation. The results from these models vary based on their internal structure. ResNet50 yields a mean absolute error (MAE) of 10.6 for males and 9.5 for females. Inception v3 has an MAE of 7.5 and 8.3 for Males and females, and GoogleNet has an MAE of 8.4 for males and 9.2 for females. These models can enhance the precision and effectiveness of bone age prediction.

26 July 2026 in Algorithms
Verified
Journal Article
Open access
PDF file
RMRaafat Salih Muhammad
Raafat Salih Muhammad
Hayder Saadi RadeafHayder Saadi Radeaf
Hayder Saadi Radeaf
HMHala J. Mohammed
Hala J. Mohammed
AAAhlam Hanoon Al-sudani
Ahlam Hanoon Al-sudani
BMBasheera M. Mahmmod
Basheera M. Mahmmod
SASadiq H. Abdulhussain
Sadiq H. Abdulhussain
Discrete Racah polynomials (DRPs) are considered essential for several applications such as approximation theory, quantum physics, and digital signal processing. However, the computation of high-order DRPs presents significant numerical and computational challenges. Even though the recent advancements in algorithms have improved numerical stability, the inherently sequential nature of these algorithms continues to be a bottleneck for large-scale implementations. This paper proposes a new multithreading-based algorithm for computing the DRP coefficients. The proposed algorithm is designed to accelerate the computation of high-order DRPs by considering the advantages of the independence of different tasks and the ability to process multiple coefficients simultaneously. The algorithm introduces distinct multithreading strategies for both zero-valued and non-zero-valued parameters, which include the zero-parameter balanced algorithm (ZPBA), the zero-parameter unbalanced algorithm (ZPUA), and the valued-parameter algorithm (VPA). The experimental results show that the proposed multithreading algorithms noticeably reduce computation time when compared to the state-of-the-art baseline algorithm. Notably, both ZPBA and VPA exhibit exceptional scalability across modern multicore architectures, delivering speedup factors exceeding 10× for large polynomial sizes. This work effectively bridges the gap between mathematical theory and high-performance computing, making the generation of large-scale DRP matrices computationally viable for advanced engineering applications.