OAOsama Moh’d Alia

Osama Moh’d Alia

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Osama Moh’d Alia has a total of 33 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Deep Learning-Based Vision Systems for Robot Semantic Navigation: An Experimental Study

    by Albandari Alotaibi, Hanan Alatawi, Aseel Binnouh, Lamaa Duwayriat, Tareq Alhmiedat, Osama Moh’d Alia

    Robot semantic navigation has received significant attention recently, as it aims to achieve reliable mapping and navigation accuracy. Object detection tasks are vital in this endeavor, as a mobile robot needs to detect and recognize the objects in the area of interest to build an effective semantic map. To achieve this goal, this paper classifies and discusses recently developed object detection approaches and then presents the available vision datasets that can be employed in robot semantic navigation applications. In addition, this paper discusses several experimental studies that have validated the efficiency of object detection algorithms, including Faster R-CNN, YOLO v5, and YOLO v8. These studies also utilized a vision dataset to design and develop efficient robot semantic navigation systems, which is also discussed. According to several experiments conducted in a Fablab area, the YOLO v8 object classification model achieved the best results in terms of classification accuracy and processing speed.


  • Open Access

    A Survey on Robot Semantic Navigation Systems for Indoor Environments

    by Raghad Alqobali, Maha Alshmrani, Reem Alnasser, Asrar Rashidi, Tareq Alhmiedat, Osama Moh’d Alia

    Robot autonomous navigation has become a vital area in the industrial development of minimizing labor-intensive tasks. Most of the recently developed robot navigation systems are based on perceiving geometrical features of the environment, utilizing sensory devices such as laser scanners, range-finders, and microwave radars to construct an environment map. However, in robot navigation, scene understanding has become essential for comprehending the area of interest and achieving improved navigation results. The semantic model of the indoor environment provides the robot with a representation that is closer to human perception, thereby enhancing the navigation task and human–robot interaction. However, semantic navigation systems require the utilization of multiple components, including geometry-based and vision-based systems. This paper presents a comprehensive review and critical analysis of recently developed robot semantic navigation systems in the context of their applications for semantic robot navigation in indoor environments. Additionally, we propose a set of evaluation metrics that can be considered to assess the efficiency of any robot semantic navigation system.


  • Open Access

    A Semantic Classification Approach for Indoor Robot Navigation

    by Ziyad Alenzi, Emad Alenzi, Mohammad Alqasir, Majed Alruwaili, Tareq Alhmiedat, Osama Moh’d Alia

    Autonomous robot navigation has become a crucial concept in industrial development for minimizing manual tasks. Most of the existing robot navigation systems are based on the perceived geometrical features of the environment, with the employment of sensory devices including laser scanners, video cameras, and microwave radars to build the environment structure. However, scene understanding is a significant issue in the development of robots that can be controlled autonomously. The semantic model of the indoor environment offers the robot a representation closer to the human perception, and this enhances navigation tasks and human–robot interaction. In this paper, we propose a low-cost and low-memory framework that offers an improved representation of the environment using semantic information based on LiDAR sensory data. The output of the proposed work is a reliable classification system for indoor environments with an efficient classification accuracy of 97.21% using the collected dataset.


  • Automatic Initialization of Level Set Methods in Discontinuity Regions of Liver in CT Scans

    by Osama Moh`d Alia, Mozaherul Hoque Abul Hasanat, Arif Bramantoro, Mahmoud Saleh Jawarneh

    This research presents a novel automatic approach to initialization of contour curve problem for the level set segmentation method inside liver discontinuity regions in CT 2D images. This approach allows different types of level set methods to achieve accurate results in segmenting liver regions. The proposed approach includes three steps. First, a pixel-level texture feature extraction of an abdominal CT scan using Gray Level Co-occurrence Matrices (GLCM) is performed. Second, Principal Component Analysis (PCA) classifier is used to classify the pixel texture features in abdominal CT scans to get the discontinuity regions (multiple lobes) of the liver. Finally, an initial contour curve inside discontinuous regions (lobes) of liver is generated and level set segmentation is performed. Experimental results on abdominal CT scans demonstrate the significant performance of our approach.

  • P-HS-SFM: a parallel harmony search algorithm for the reproduction of experimental data in the continuous microscopic crowd dynamic models

    by Khalid Mohammad Jaber, Osama Moh’d Alia, Mohammed Mahmod Shuaib

    Finding the optimal parameters that can reproduce experimental data (such as the velocity–density relation and the specific flow rate) is a very important component of the validation and calibration of microscopic crowd dynamic models. Heavy computational demand during parameter search is a known limitation that exists in a previously developed model known as the Harmony Search-Based Social Force Model (HS-SFM). In this paper, a parallel-based mechanism is proposed to reduce the computational time and memory resource utilisation required to find these parameters. More specifically, two MATLAB-based multicore techniques (parfor and create independent jobs) using shared memory are developed by taking advantage of the multithreading capabilities of parallel computing, resulting in a new framework called the Parallel Harmony Search-Based Social Force Model (P-HS-SFM). The experimental results show that the parfor-based P-HS-SFM achieved a better computational time of about 26 h, an efficiency improvement of 54% and a speedup factor of 2.196 times in comparison with the HS-SFM sequential processor. The performance of the P-HS-SFM using the create independent jobs approach is also comparable to parfor with a computational time of 26.8 h, an efficiency improvement of about 30% and a speedup of 2.137 times.


  • Maximizing Wireless Sensor Network Coverage With Minimum Cost Using Harmony Search Algorithm

    by Osama Moh'D Alia, Alaa Al-Ajouri

    Coverage, one of the most important performance metrics for wireless sensor networks, reflects on how well a sensor field is monitored. Coverage problem is a devoted study of a node placement optimization problem in the coverage configuration before network deployment, where the objective is to find the optimal locations to place sensor nodes, such that the number of nodes (or the network cost) can be minimized and the coverage requirements can be satisfied. In this paper, we propose a harmony search (HS)-based deployment algorithm that can locate the optimal number of sensor nodes as well as their optimal locations for maximizing the network coverage and minimizing the network cost. The ability of HS is modified to automatically evolve the appropriate number of sensor nodes as well as their optimal locations. This can be accomplished by integrating the concept of adaptable length encoding in each solution vector to represent a variable number of candidate sensor nodes. Network coverage ratio, number of sensor nodes, and minimum distance between sensor nodes are the chief elements of a new objective function that has been offered to confirm the choice of the optimal number of sensor nodes and their positions. Experimental results show the ability of the proposed algorithm to find the appropriate number of sensor nodes and their locations. Furthermore, a comparative study with a metaheuristic Genetic-based algorithm and a random deployment technique has also been conducted and its results confirm the superiority of the proposed algorithm.


  • Open Access

    A Harmony Search Algorithm for the Reproduction of Experimental Data in the Social Force Model

    by Osama Moh'D Alia, Mohammed Mahmod Shuaib

    Crowd dynamics is a discipline dealing with the management and flow of crowds in congested places and circumstances. Pedestrian congestion is a pressing issue where crowd dynamics models can be applied. The reproduction of experimental data (velocity-density relation and specific flow rate) is a major component for the validation and calibration of such models. In the social force model, researchers have proposed various techniques to adjust essential parameters governing the repulsive social force, which is an effort at reproducing such experimental data. Despite that and various other efforts, the optimal reproduction of the real life data is unachievable. In this paper, a harmony search-based technique called HS-SFM is proposed to overcome the difficulties of the calibration process for SFM, where the fundamental diagram of velocity-density relation and the specific flow rate are reproduced in conformance with the related empirical data. The improvisation process of HS is modified by incorporating the global best particle concept from particle swarm optimization (PSO) to increase the convergence rate and overcome the high computational demands of HS-SFM. Simulation results have shown HS-FSM’s ability to produce near optimal SFM parameter values, which makes it possible for SFM to almost reproduce the related empirical data.


  • Musicians'-inspired clustering protocol for efficient energy Wireless Sensor Networks

    by Osama Moh'D Alia, Zyad Shaaban, Ahmad Basheer, Alaa Al-Ajouri, Ahmed Alsswey

    In the development of cluster-based energy-efficiency protocols for Wireless Sensor Networks (WSNs), a particularly challenging problem is how to dynamically organize the sensors into a wireless communication network and route sensed information from the field sensors to a remote base station in a matter that prolongs the lifetime of WSNs. This paper presents a new energy-efficient dynamic clustering algorithm for WSNs that automatically organizes the sensors into an appropriate number of clusters in the network. This algorithm, which is based on Harmony Search Algorithm, music based meta-heuristic optimization algorithm, eliminates the need to set the number of clusters a priori. In addition, a multi-objective approach is utilized in the cluster head selection algorithm in order to select the best set of cluster heads. Simulation results demonstrate that the proposed algorithm can achieve an optimal number of clusters, as well as prolong the network lifetime and increase the data delivery at the base station when compared to other well-known clustering-based routing protocols.