Search

Your search keyword '"Abdulhussain, Sadiq H."' showing total 110 results
Start Over Author "Abdulhussain, Sadiq H." Publication Year Range Last 10 years
110 results on '"Abdulhussain, Sadiq H."'

1. Accelerated and Improved Stabilization for High Order Moments of Racah Polynomials

Author

Mahmmod, Basheera M., Abdulhussain, Sadiq H., and Suk, Tomáš

Subjects
Mathematics - Numerical Analysis, Computer Science - Computer Vision and Pattern Recognition, Electrical Engineering and Systems Science - Image and Video Processing
Abstract

One of the most effective orthogonal moments, discrete Racah polynomials (DRPs) and their moments are used in many disciplines of sciences, including image processing, and computer vision. Moments are the projections of a signal on the polynomial basis functions. Racah polynomials were introduced by Wilson and modified by Zhu for image processing and they are orthogonal on a discrete set of samples. However, when the moment order is high, they experience the issue of numerical instability. In this paper, we propose a new algorithm for the computation of DRPs coefficients called Improved Stabilization (ImSt). In the proposed algorithm, {the DRP plane is partitioned into four parts, which are asymmetric because they rely on the values of the polynomial size and the DRP parameters.} The logarithmic gamma function is utilized to compute the initial values, which empower the computation of the initial value for a wide range of DRP parameter values as well as large size of the polynomials. In addition, a new formula is used to compute the values of the initial sets based on the initial value. Moreover, we optimized the use of the stabilizing condition in specific parts of the algorithm. ImSt works for wider range of parameters until higher degree than the current algorithms. We compare it with the other methods in a number of experiments.

Published
2022

2. Fast Computation of Hahn Polynomials for High Order Moments

Author

Mahmmod, Basheera M., Abdulhussain, Sadiq H., Suk, Tomáš, and Hussain, Abir

Subjects
Computer Science - Computer Vision and Pattern Recognition, Electrical Engineering and Systems Science - Image and Video Processing
Abstract

Discrete Hahn polynomials (DHPs) and their moments are considered to be one of the efficient orthogonal moments and they are applied in various scientific areas such as image processing and feature extraction. Commonly, DHPs are used as object representation; however, they suffer from the problem of numerical instability when the moment order becomes large. In this paper, an efficient method for computation of Hahn orthogonal basis is proposed and applied to high orders. This paper developed a new mathematical model for computing the initial value of the DHP and for different values of DHP parameters ($\alpha$ and $\beta$). In addition, the proposed method is composed of two recurrence algorithms with an adaptive threshold to stabilize the generation of the DHP coefficients. It is compared with state-of-the-art algorithms in terms of computational cost and the maximum size that can be correctly generated. The experimental results show that the proposed algorithm performs better in both parameters for wide ranges of parameter values of ($\alpha$ and $\beta$) and polynomial sizes., Comment: This first of this paper is submitted to Pattern Recognition at June 15, 2020 This version of the manuscript is submitted to PLOS ONE

Published
2021
Full Text
View/download PDF

15. Performance enhancement of high order Hahn polynomials using multithreading.

Author

Mahmmod, Basheera M., Flayyih, Wameedh Nazar, Fakhri, Zainab Hassan, Abdulhussain, Sadiq H., Khan, Wasiq, and Hussain, Abir

Subjects
POLYNOMIALS, PROCESS capability, FEATURE extraction, COMPUTER vision, VISUAL fields
Abstract

Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for various values of DHaPs parameters, sizes, and different values of threads. In comparison to the unthreaded situation, the results demonstrate an improvement in the processing time which increases as the polynomial size increases, reaching its maximum of 5.8 in the case of polynomial size and order of 8000 × 8000 (matrix size). Furthermore, the trend of continuously raising the number of threads to enhance performance is inconsistent and becomes invalid at some point when the performance improvement falls below the maximum. The number of threads that achieve the highest improvement differs according to the size, being in the range of 8 to 16 threads in 1000 × 1000 matrix size, whereas at 8000 × 8000 case it ranges from 32 to 160 threads. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

22. Performance Analysis of Adopting FSO Technology for Wireless Data Center Network.

Author

AlGhadhban, Amer, Abdulhussain, Sadiq H., Alazmi, Meshari, and Almalaq, Abdulaziz

Subjects
SERVER farms (Computer network management), OPTICAL communications, FREE-space optical technology, RANDOM variables
Abstract

Free Space Optical Communication (FSO) is a promising technology to address wired Data Center Network (DCN) challenges like power consumption, low scalability and flexibility, congestion and cabling. Scholars have developed indirect line-of-sight (LoS) FSO schemes by reflecting the FSO beams via switchable mirrors. These schemes have introduced extra overhead delay to establish indirect LoS links, defined herein as the rack-to-rack FSO link setup process. The purpose of this work is to study and model this setup process with the consideration of the DC workloads. We found that the process involves a sequence of i.i.d random variables that contribute differently to its delay. Also, the process shows a statistical characteristic close to M/M/K. However, the number of FSO links, K, is random with time, which necessitates careful modeling. Finally, the PDF of the process total response time is close to the hypoexponential distribution, and it maintains its main characteristics even with different distributions for the service time. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

28. Downlink Training Sequence Design Based on Waterfilling Solution for Low-Latency FDD Massive MIMO Communications Systems.

Author

Naser, Marwah Abdulrazzaq, Abdul-Hadi, Alaa M., Alsabah, Muntadher, Mahmmod, Basheera M., Majeed, Ammar, and Abdulhussain, Sadiq H.

Subjects
MIMO systems, WIRELESS channels, WIRELESS communications, CHANNEL estimation, COVARIANCE matrices, MOBILE communication systems, COMPUTATIONAL complexity
Abstract

Future generations of wireless communications systems are expected to evolve toward allowing massive ubiquitous connectivity and achieving ultra-reliable and low-latency communications (URLLC) with extremely high data rates. Massive multiple-input multiple-output (m-MIMO) is a crucial transmission technique to fulfill the demands of high data rates in the upcoming wireless systems. However, obtaining a downlink (DL) training sequence (TS) that is feasible for fast channel estimation, i.e., meeting the low-latency communications required by future generations of wireless systems, in m-MIMO with frequency-division-duplex (FDD) when users have different channel correlations is very challenging. Therefore, a low-complexity solution for designing the DL training sequences to maximize the achievable sum rate of FDD systems with limited channel coherence time (CCT) is proposed using a waterfilling power allocation method. This achievable sum rate maximization is achieved using sequences produced from a summation of the user's covariance matrices and then applying a waterfilling power allocation method to the obtained low-complexity training sequence. The results show that the proposed TS outperforms the existing methods in the medium and high SNR regimes while reducing computational complexity. The obtained results signify the proposed TS's feasibility for practical consideration compared with the existing DL training sequence designs. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

41. 6G Wireless Communications Networks: A Comprehensive Survey

Author

Alsabah, Muntadher, primary, Naser, Marwah Abdulrazzaq, additional, Mahmmod, Basheera M., additional, Abdulhussain, Sadiq H., additional, Eissa, Mohammad R., additional, Al-Baidhani, Ahmed, additional, Noordin, Nor K., additional, Sait, Sadiq M., additional, Al-Utaibi, Khaled A., additional, and Hashim, Fazirul, additional

Published
2021
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results