Mohamed H. Mousa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mohamed H. Mousa has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Mohamed K. Hussein
Professor of Computer Science Department, Suez Canal University, Ismailia, Egypt
3 shared publications Fatma Khairy
Computer Science Department, Suez Canal University, Ismailia 41522, Egypt
2 shared publicationsHamed Nassar
Dept. of Computer Science, Suez Canal University, Ismailia, Egypt
2 shared publications- Hamed Nassar
Computer Science Department, Suez Canal University, Ismailia, Egypt
2 shared publications Mohamed K. Hussein
2 shared publicationsMohamed S. Yasein
Dept. of Elec. Eng., Port Said University, Egypt
2 shared publications
Latest Publications
- Open Access
- 28 May 2025
- Published by International Academic Press in Statistics, Optimization & Information Computing
- Vol. 14 (2) , 789-807
Improving spectral segmentation of 3D meshes using face patches
A huge amount of research work has been devoted in recent years to segmentation of 3D meshes composed of planar triangular faces. In particular, spectral segmentation has had a fair share of this work because it is extremely faster than other segmentation techniques, especially those based on AI and machine learning. However, existing spectral segmentation techniques suffer from complex processing and heavy computation due to dealing directly with these faces. The present article is an attempt to address this issue by proposing an effective technique based on grouping the faces skillfully into higher-level structures called patches. Specifically, each patch is made of two neighbor faces, effectively cutting the number of low level structures processed by the segmentation technique into almost half. However, since the constituent mesh structures have changed from face to patch, the normal spectral segmentation methodology is altered to suit the new geometry. This alteration is reflected on the number of elements of both the eigenvectors and weight matrix, both reduced almost by 50\%. We have validated the proposed technique by segmenting numerous 3D meshes from public repositories. The resulting segments are colored in order to distinguish visually between different parts of the same 3D mesh. The experimental results indicate, both visually and quantitatively, that the proposed technique matches the performance of the best state-of-the-art methodologies, but at about half the time and space cost.
- 28 May 2025
- Published by International Academic Press in Statistics, Optimization & Information Computing
- Vol. 14 (2) , 789-807
Open AccessImproving spectral segmentation of 3D meshes using face patches
A huge amount of research work has been devoted in recent years to segmentation of 3D meshes composed of planar triangular faces. In particular, spectral segmentation has had a fair share of this work because it is extremely faster than other segmentation techniques, especially those based on AI and machine learning. However, existing spectral segmentation techniques suffer from complex processing and heavy computation due to dealing directly with these faces. The present article is an attempt to address this issue by proposing an effective technique based on grouping the faces skillfully into higher-level structures called patches. Specifically, each patch is made of two neighbor faces, effectively cutting the number of low level structures processed by the segmentation technique into almost half. However, since the constituent mesh structures have changed from face to patch, the normal spectral segmentation methodology is altered to suit the new geometry. This alteration is reflected on the number of elements of both the eigenvectors and weight matrix, both reduced almost by 50\%. We have validated the proposed technique by segmenting numerous 3D meshes from public repositories. The resulting segments are colored in order to distinguish visually between different parts of the same 3D mesh. The experimental results indicate, both visually and quantitatively, that the proposed technique matches the performance of the best state-of-the-art methodologies, but at about half the time and space cost.
- Open Access
- 24 July 2024
- Published by International Academic Press in Statistics, Optimization & Information Computing
- Vol. 12 (6) , 1873-1885
Interference-aware scheme to improve distributed caching in cellular networks via D2D underlay communications
Underlay Device-to-Device (D2D) communications is a promising networking technology intended to boost thespectral efficiency of future cellular networks, including 5G and beyond. When used for distributed caching, where cellulardevices store popular files for direct exchange later with other devices away from the cellular infrastructure, the technologybears more fruits such as enhancing throughput, reducing latency and offloading the infrastructure. However, due to theirnon-orthogonality, underlay D2D communications can result in excessive interference to the cellular user. To avoid thisproblem, the present article proposes a scheme with two interference-reduction elements: a guard zone intended to allowD2D communications only for devices far enough from the base station (BS), and a pairing strategy intended to allow D2Dpairing for only devices that are close enough to each other. We assess the performance of the scheme using a stochasticgeometry (SG) model, through which we characterize the coverage probability of the cellular user. This probability is aprincipal indicator of maintaining the quality of service (QoS) of the cellular user and of enabling successful caching for theD2D user. We introduce in the process a novel empirical technique which, given a desired level of interference, identifiesan upper bound for the distance between two devices to be paired without exceeding that level. We finally validate theanalytical findings obtained from the model by intensive simulation to ensure the correctness of both the model and thescheme performance. A salient feature of the scheme is that it requires for its implementation no software or hardwaremodification in the device
- 24 July 2024
- Published by International Academic Press in Statistics, Optimization & Information Computing
- Vol. 12 (6) , 1873-1885
Open AccessInterference-aware scheme to improve distributed caching in cellular networks via D2D underlay communications
Underlay Device-to-Device (D2D) communications is a promising networking technology intended to boost thespectral efficiency of future cellular networks, including 5G and beyond. When used for distributed caching, where cellulardevices store popular files for direct exchange later with other devices away from the cellular infrastructure, the technologybears more fruits such as enhancing throughput, reducing latency and offloading the infrastructure. However, due to theirnon-orthogonality, underlay D2D communications can result in excessive interference to the cellular user. To avoid thisproblem, the present article proposes a scheme with two interference-reduction elements: a guard zone intended to allowD2D communications only for devices far enough from the base station (BS), and a pairing strategy intended to allow D2Dpairing for only devices that are close enough to each other. We assess the performance of the scheme using a stochasticgeometry (SG) model, through which we characterize the coverage probability of the cellular user. This probability is aprincipal indicator of maintaining the quality of service (QoS) of the cellular user and of enabling successful caching for theD2D user. We introduce in the process a novel empirical technique which, given a desired level of interference, identifiesan upper bound for the distance between two devices to be paired without exceeding that level. We finally validate theanalytical findings obtained from the model by intensive simulation to ensure the correctness of both the model and thescheme performance. A salient feature of the scheme is that it requires for its implementation no software or hardwaremodification in the device
- Open Access
- 10 February 2022
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 99
Toward high-performance computation of surface approximation using a GPU
- 10 February 2022
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 99
Open AccessToward high-performance computation of surface approximation using a GPU
- Open Access
- 1 January 2022
- Published by Tech Science Press in Computer Modeling in Engineering & Sciences
- Vol. 133 (2) , 413-434
Efficient UAV-Based MEC Using GPU-Based PSO and Voronoi Diagrams
Mobile-Edge Computing (MEC) displaces cloud services as closely as possible to the end user. This enables the edge servers to execute the offloaded tasks that are requested by the users, which in turn decreases the energy consumption and the turnaround time delay. However, as a result of a hostile environment or in catastrophic zones with no network, it could be difficult to deploy such edge servers. Unmanned Aerial Vehicles (UAVs) can be employed in such scenarios. The edge servers mounted on these UAVs assist with task offloading. For the majority of IoT applications, the execution times of tasks are often crucial. Therefore, UAVs tend to have a limited energy supply. This study presents an approach to offload IoT user applications based on the usage of Voronoi diagrams to determine task delays and cluster IoT devices dynamically as a first step. Second, the UAV flies over each cluster to perform the offloading process. In addition, we propose a Graphics Processing Unit (GPU)-based parallelization of particle swarm optimization to balance the cluster sizes and identify the shortest path along these clusters while minimizing the UAV flying time and energy consumption. Some evaluation results are given to demonstrate the effectiveness of the presented offloading strategy.
- 1 January 2022
- Published by Tech Science Press in Computer Modeling in Engineering & Sciences
- Vol. 133 (2) , 413-434
Open AccessEfficient UAV-Based MEC Using GPU-Based PSO and Voronoi Diagrams
Mobile-Edge Computing (MEC) displaces cloud services as closely as possible to the end user. This enables the edge servers to execute the offloaded tasks that are requested by the users, which in turn decreases the energy consumption and the turnaround time delay. However, as a result of a hostile environment or in catastrophic zones with no network, it could be difficult to deploy such edge servers. Unmanned Aerial Vehicles (UAVs) can be employed in such scenarios. The edge servers mounted on these UAVs assist with task offloading. For the majority of IoT applications, the execution times of tasks are often crucial. Therefore, UAVs tend to have a limited energy supply. This study presents an approach to offload IoT user applications based on the usage of Voronoi diagrams to determine task delays and cluster IoT devices dynamically as a first step. Second, the UAV flies over each cluster to perform the offloading process. In addition, we propose a Graphics Processing Unit (GPU)-based parallelization of particle swarm optimization to balance the cluster sizes and identify the shortest path along these clusters while minimizing the UAV flying time and energy consumption. Some evaluation results are given to demonstrate the effectiveness of the presented offloading strategy.
- Open Access
- 5 August 2021
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 16 (8) , e0255832
High-performance simplification of triangular surfaces using a GPU
Due to advances in high-performance computing technologies, computer graphics techniques—especially those related to mesh simplification—have been noticeably improved. These techniques, which have a strong impact on many applications, such as geometric modeling and visualization, have been well studied for more than two decades. Recent advances in GPUs have led to significant improvements in terms of speed and interactivity. In this paper, we present a mesh simplification algorithm that benefits from the parallel framework provided by recent GPUs. We customize the halfedge data structure for adaption with the dynamic memory restrictions of CUDA. The proposed algorithm is fully parallelized by employing a lock-free skip priority queue and a set of disjoint regions of the mesh. The proposed technique accelerates the simplification process while preserving the topological properties of the mesh. Some results and comparisons are provided to verify the efficiency of the proposed algorithm.
- 5 August 2021
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 16 (8) , e0255832
Open AccessHigh-performance simplification of triangular surfaces using a GPU
Due to advances in high-performance computing technologies, computer graphics techniques—especially those related to mesh simplification—have been noticeably improved. These techniques, which have a strong impact on many applications, such as geometric modeling and visualization, have been well studied for more than two decades. Recent advances in GPUs have led to significant improvements in terms of speed and interactivity. In this paper, we present a mesh simplification algorithm that benefits from the parallel framework provided by recent GPUs. We customize the halfedge data structure for adaption with the dynamic memory restrictions of CUDA. The proposed algorithm is fully parallelized by employing a lock-free skip priority queue and a set of disjoint regions of the mesh. The proposed technique accelerates the simplification process while preserving the topological properties of the mesh. Some results and comparisons are provided to verify the efficiency of the proposed algorithm.
- Open Access
- 18 April 2020
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 34 (4) , 1431-1438
Surface approximation using GPU-based localized fourier transform
- 18 April 2020
- Published by Springer Nature in Journal of King Saud University Computer and Information Sciences
- Vol. 34 (4) , 1431-1438
Open AccessSurface approximation using GPU-based localized fourier transform
- Top Cited PapersOpen Access
- 21 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 37191-37201
Efficient Task Offloading for IoT-Based Applications in Fog Computing Using Ant Colony Optimization
The current thinking concerning computations required by Internet of Things (IoT) applications is shifting toward fog computing instead of cloud computing, thereby achieving most of the required computations at the network edge of the IoT devices. Fog computing can thus improve the quality of service of delay-sensitive applications by allowing such applications to take advantage of the low latency provided by fog computing rather than the high latency of the cloud. Therefore, tasks in various IoT applications must be effectively distributed over the fog nodes to improve the quality of service, specifically the task response time. In this paper, two nature-inspired meta-heuristic schedulers, namely ant colony optimization (ACO) and particle swarm optimization (PSO), are used to propose two different scheduling algorithms to effectively load balance IoT tasks over the fog nodes under communication cost and response time considerations. The experimental results of the proposed algorithms are compared with those of the round robin (RR) algorithm. The evaluations show that the proposed ACO-based scheduler achieves an improvement in the response times of IoT applications compared to the proposed PSO-based and RR algorithms and effectively load balances the fog nodes.
- 21 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 37191-37201
Top Cited PapersOpen AccessEfficient Task Offloading for IoT-Based Applications in Fog Computing Using Ant Colony Optimization
The current thinking concerning computations required by Internet of Things (IoT) applications is shifting toward fog computing instead of cloud computing, thereby achieving most of the required computations at the network edge of the IoT devices. Fog computing can thus improve the quality of service of delay-sensitive applications by allowing such applications to take advantage of the low latency provided by fog computing rather than the high latency of the cloud. Therefore, tasks in various IoT applications must be effectively distributed over the fog nodes to improve the quality of service, specifically the task response time. In this paper, two nature-inspired meta-heuristic schedulers, namely ant colony optimization (ACO) and particle swarm optimization (PSO), are used to propose two different scheduling algorithms to effectively load balance IoT tasks over the fog nodes under communication cost and response time considerations. The experimental results of the proposed algorithms are compared with those of the round robin (RR) algorithm. The evaluations show that the proposed ACO-based scheduler achieves an improvement in the response times of IoT applications compared to the proposed PSO-based and RR algorithms and effectively load balances the fog nodes.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 277-281
Pedestrian detection using shape context and PHOG
This paper describes a new method for pedestrian detection. The focus of the proposed method is to enhance the number of detected pedestrian and to achieve high accuracy with low rates of false negative detection. The method has two stages: the first stage detects pedestrians using part based detector (poselet) while the second stage further detects people by combine top-down recognition with bottom-up image segmentation. For feature extraction, Pyramid Histogram of Orientation Gradient (PHOG) and Shape Context (SC) are used. The proposed method was tested on a popular pedestrian detection benchmark dataset “INRIA person data set” and experimental results show that the detection method achieves high accuracy with low rates of false negative detection.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 277-281
Pedestrian detection using shape context and PHOG
This paper describes a new method for pedestrian detection. The focus of the proposed method is to enhance the number of detected pedestrian and to achieve high accuracy with low rates of false negative detection. The method has two stages: the first stage detects pedestrians using part based detector (poselet) while the second stage further detects people by combine top-down recognition with bottom-up image segmentation. For feature extraction, Pyramid Histogram of Orientation Gradient (PHOG) and Shape Context (SC) are used. The proposed method was tested on a popular pedestrian detection benchmark dataset “INRIA person data set” and experimental results show that the detection method achieves high accuracy with low rates of false negative detection.
- 1 August 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 447-452
Matching 3D objects using principle curvatures descriptors
The ability to identify similarities between shapes is important for applications such as medical diagnosis, object registration and alignment, and shape retrieval. This paper focuses on handling this issue using one of the well-known features that describe the local intrinsic properties of the shape. This feature is the principle curvatures (k1, k2) of the 3D shape. We introduce a framework of stable mathematical calculations to approximate these geometric properties. Once the principle curvatures are calculated, we can construct, for each shape, a matrix that represents two dimensional distribution of these curvatures as a shape descriptor for further searching operation. This descriptor is invariant to shape orientation and reflects the geometric properties of the surface. Experimental results are presented and it proves the robustness of the descriptor.
- 1 August 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 447-452
Matching 3D objects using principle curvatures descriptors
The ability to identify similarities between shapes is important for applications such as medical diagnosis, object registration and alignment, and shape retrieval. This paper focuses on handling this issue using one of the well-known features that describe the local intrinsic properties of the shape. This feature is the principle curvatures (k1, k2) of the 3D shape. We introduce a framework of stable mathematical calculations to approximate these geometric properties. Once the principle curvatures are calculated, we can construct, for each shape, a matrix that represents two dimensional distribution of these curvatures as a shape descriptor for further searching operation. This descriptor is invariant to shape orientation and reflects the geometric properties of the surface. Experimental results are presented and it proves the robustness of the descriptor.
- 1 August 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 453-457
3D object compression using enhanced stripification technique
3D meshes are one of the most common representations of 3D objects that have been used in graphics applications. They often require a huge amount of data for storage and/or transmission. In this paper, we present a new compression algorithm based on stripification of the geometric models that enables us to progressively visualize the 3D models during their transmission. The proposed algorithm encodes the geometry and the connectivity of the input model in an interwoven fashion. The main idea is to store 3D objects as strips files. The algorithm achieves compression ratios above 61 : 1 over ASCII encoded formats resulting in faster transmission and rendering of complex graphical objects.
- 1 August 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 453-457
3D object compression using enhanced stripification technique
3D meshes are one of the most common representations of 3D objects that have been used in graphics applications. They often require a huge amount of data for storage and/or transmission. In this paper, we present a new compression algorithm based on stripification of the geometric models that enables us to progressively visualize the 3D models during their transmission. The proposed algorithm encodes the geometry and the connectivity of the input model in an interwoven fashion. The main idea is to store 3D objects as strips files. The algorithm achieves compression ratios above 61 : 1 over ASCII encoded formats resulting in faster transmission and rendering of complex graphical objects.