Mohammed Wajid Alneama

Dr. Mohammed Wajid Alneama

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
12 June 2014 in BioMed Research International
Verified
Journal Article
Open access
PDF file
MAMohammed Wajid Alneama
Mohammed Wajid Alneama
NRNaglaa Mohammed Reda
Naglaa Mohammed Reda
FGFayed F. M. Ghaleb
Fayed F. M. Ghaleb
Distance matrix has diverse usage in different research areas. Its computation is typically an essential task in most bioinformatics applications, especially in multiple sequence alignment. The gigantic explosion of biological sequence databases leads to an urgent need for accelerating these computations.DistVectalgorithm was introduced in the paper of Al-Neama et al. (in press) to present a recent approach for vectorizing distance matrix computing. It showed an efficient performance in both sequential and parallel computing. However, the multicore cluster systems, which are available now, with their scalability and performance/cost ratio, meet the need for more powerful and efficient performance. This paper proposesDistVect1as highly efficient parallel vectorized algorithm with high performance for computing distance matrix, addressed to multicore clusters. It reformulatesDistVect1vectorized algorithm in terms of clusters primitives. It deduces an efficient approach of partitioning and scheduling computations, convenient to this type of architecture. Implementations employ potential of both MPI and OpenMP libraries. Experimental results show that the proposed method performs improvement of around 3-fold speedup upon SSE2. Further it also achieves speedups more than 9 orders of magnitude compared to the publicly available parallel implementation utilized in ClustalW-MPI.

1 February 2023 in Indonesian Journal of Electrical Engineering and Computer Science
Verified
Journal Article
Open access
PDF file
MAMohammed Wajid Alneama
Mohammed Wajid Alneama
AAAbeer A. Mohamad Alshiha
Abeer A. Mohamad Alshiha
MSMustafa Ghanem Saeed
Mustafa Ghanem Saeed
This work offers a graphics processing unit (GPU)-based system for real-time face recognition, which can detect and identify faces with high accuracy. This work created and implemented novel parallel strategies for image integral, computation scan window processing, and classifier amplification and correction as part of the face identification phase of the Viola-Jones cascade classifier. Also, the algorithm and parallelized a portion of the testing step during the facial recognition stage were experimented with. The suggested approach significantly improves existing facial recognition methods by enhancing the performance of two crucial components. The experimental findings show that the proposed method, when implemented on an NVidia GTX 570 graphics card, outperforms the typical CPU program by a factor of 19.72 in the detection phase and 1573 in the recognition phase, with only 2000 images trained and 40 images tested. The recognition rate will plateau when the hardware's capabilities are maxed out. This demonstrates that the suggested method works well in real-time.

1 April 2023 in Indonesian Journal of Electrical Engineering and Computer Science
Verified
Journal Article
Open access
PDF file
AAAbeer A. Mohamad Alshiha
Abeer A. Mohamad Alshiha
MAMohammed Wajid Alneama
Mohammed Wajid Alneama
AQAbdalrahman Qubaa
Abdalrahman Qubaa
The expansion of biometric applications and databases is worrying. Processing extensive or sophisticated biometric data results in longer wait times, which might restrict application usefulness. This work focuses on accelerating the processing of biometric data and proposes a parallel method of data processing that exceeds the capabilities of a central processing unit (CPU). The combination of the graphics processing unit (GPU) and compute unified device architecture (CUDA) results in at least three times the processing speed of a published accurate and secure multimodal biometric system. The GPU-assisted approach beats the CPU-only implementation when saturating the CPU-only performance with more people than the available thread count. The GPU-assisted solution is also proven to have the same accuracy as the original system, indicating accuracy and processing performance improvements in the demanding big data environment.

30 October 2023 in International Journal of Electrical and Electronics Research
Verified
Journal Article
Open access
PDF file
AAAbeer A. Mohamad Alshiha
Abeer A. Mohamad Alshiha
MAMohammed Wajid Alneama
Mohammed Wajid Alneama
AQAbdalrahman Qubaa
Abdalrahman Qubaa
This paper introduces a pioneering Hybrid Parallel Multi-linear Face Recognition algorithm that capitalizes on multi-linear methodologies, such as Multi-linear Principal Component Analysis (MPCA), Linear Discriminant Analysis (LDA), and Histogram of Oriented Gradients (HOG), to attain exceptional recognition performance. The Hybrid Feature Selection (HFS) algorithm is meticulously crafted to augment the classification performance on the CK+ and FERET datasets by amalgamating the strengths of feature extraction techniques and feature selection methods. HFS seamlessly incorporates Principal Component Analysis (PCA), Local Discriminant Analysis (LDA), and HOG. The primary aim of this algorithm is to autonomously identify a subset of the most distinctive features from the extracted feature pool, thus elevating classification accuracy, precision, recall, and F1-Score. By amalgamating these methodologies, the algorithm adeptly diminishes dimensionality while conserving pivotal features. Experimental trials on facial image datasets, CK+ and FERET, underscore the algorithm's supremacy in terms of accuracy and computational efficiency when contrasted with conventional linear techniques and even certain deep learning approaches. The proposed algorithm proffers an encouraging solution for real-world face recognition applications where precision and operational efficiency are of paramount significance.

1 January 2020 in Bulletin of the South Ural State University. Series "Mathematical Modelling, Programming and Computer Software"
Verified
Journal Article
Closed access
TUTikrit University
Tikrit University
WYW.B. Yahia
W.B. Yahia
GAG.E. Arif
G.E. Arif
MAMohammed Wajid Alneama
Mohammed Wajid Alneama
MUMosul University
Mosul University

1 August 2023 in Indonesian Journal of Electrical Engineering and Computer Science
Verified
Journal Article
Open access
PDF file
MAMohammed Wajid Alneama
Mohammed Wajid Alneama
IAIman Abdulwahab Ahmed
Iman Abdulwahab Ahmed
SASalwa M. Ali
Salwa M. Ali
The traveling salesman problem (TSP) is a problem in computer science that has been extensively studied and has a wide variety of real-world applications. It is considered an NP-hard issue since the only way to get a precise solution to it is to wait an exponentially long amount of time unless P=NP. Both accurate and heuristic algorithms exist to tackle this problem. The Branch-and-Bound algorithm (BnB) is often regarded as the most significant precise approach, despite the fact that it traverses, in the worst scenario, all potential tours in order to calculate the tour efficiently. This study proposed an efficient parallel algorithm to solve TSP by using a cluster multicore system. An exact algorithm will be used to get the optimal solution, and to expedite the search for the best path, we have employed a multi-threaded approach that capitalizes on the processing power of multiple CPU cores to concurrently process sub-problems.