muhammad Ashraf Abdelhamid ABDELGAWAD

Mr. muhammad Ashraf Abdelhamid ABDELGAWAD


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
23 June 2025 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
MAmuhammad Ashraf Abdelhamid ABDELGAWAD
muhammad Ashraf Abdelhamid ABDELGAWAD
RCRay C.C. Cheung
Ray C.C. Cheung
HYHong Yan
Hong Yan
In this article, we develop an online method called IncTSVD to incrementally compute the tensor singular value decomposition (TSVD) of a given sequence of third-order tensors based on the tensor-tensor concept. This can be considered an extension of incremental SVD based on updating matrices to tensors. IncTSVD is suitable for streamed tensor data and where memory resources are limited. Most existing methods to compute TSVD focus on approximating it using randomized or sketching techniques in a batch setting to decrease the storage and computational costs required. The IncTSVD extends the computation of TSVD to streaming by maintaining the basis tensors of previously arrived data and incrementally updating the approximation using the tensor of incoming data. The computational cost and approximation error of the proposed method were analyzed theoretically and through extensive numerical experiments, which included using synthetic and real-world datasets under streaming scenarios. The IncTSVD method was superior to existing deterministic and randomized tensor decompositions (TDs) based on the t-product for computational and storage costs, and had comparable accuracy to the standard TSVD method.

22 February 2024 in Remote Sensing
Verified
Journal Article
Open access
PDF file
MAmuhammad Ashraf Abdelhamid ABDELGAWAD
muhammad Ashraf Abdelhamid ABDELGAWAD
RCRay C.C. Cheung
Ray C.C. Cheung
HYHong Yan
Hong Yan
Hyperspectral imaging captures detailed spectral data for remote sensing. However, due to the limited spatial resolution of hyperspectral sensors, each pixel of a hyperspectral image (HSI) may contain information from multiple materials. Although the hyperspectral unmixing (HU) process involves estimating endmembers, identifying pure spectral components, and estimating pixel abundances, existing algorithms mostly focus on just one or two tasks. Blind source separation (BSS) based on nonnegative matrix factorization (NMF) algorithms identify endmembers and their abundances at each pixel of HSI simultaneously. Although they perform well, the factorization results are unstable, require high computational costs, and are difficult to interpret from the original HSI. CUR matrix decomposition selects specific columns and rows from a dataset to represent it as a product of three small submatrices, resulting in interpretable low-rank factorization. In this paper, we propose a new blind HU framework based on CUR factorization called CUR-HU that performs the entire HU process by exploiting the low-rank structure of given HSIs. CUR-HU incorporates several techniques to perform the HU process with a performance comparable to state-of-the-art methods but with higher computational efficiency. We adopt a deterministic sampling method to select the most informative pixels and spectrum components in HSIs. We use an incremental QR decomposition method to reduce computation complexity and estimate the number of endmembers. Various experiments on synthetic and real HSIs are conducted to evaluate the performance of CUR-HU. CUR-HU performs comparably to state-of-the-art methods for estimating the number of endmembers and abundance maps, but it outperforms other methods for estimating the endmembers and the computational efficiency. It has a 9.4 to 249.5 times speedup over different methods for different real HSIs.

17 May 2025 in Neurocomputing
Verified
Journal Article
Closed access
MAmuhammad Ashraf Abdelhamid ABDELGAWAD
muhammad Ashraf Abdelhamid ABDELGAWAD
RCRay C.C. Cheung
Ray C.C. Cheung
HYHong Yan
Hong Yan

17 October 2025 in Neurocomputing
Verified
Journal Article
Closed access
MAmuhammad Ashraf Abdelhamid ABDELGAWAD
muhammad Ashraf Abdelhamid ABDELGAWAD
RCRay C.C. Cheung
Ray C.C. Cheung
HYHong Yan
Hong Yan

25 February 2025 in The Journal of Supercomputing
Verified
Journal Article
Open access
PDF file
AMAjita Misra
Ajita Misra
MAmuhammad Ashraf Abdelhamid ABDELGAWAD
muhammad Ashraf Abdelhamid ABDELGAWAD
PJPeng Jing
Peng Jing
RCRay C.C. Cheung
Ray C.C. Cheung
HYHong Yan
Hong Yan
Tensor decomposition algorithms are essential for extracting meaningful latent variables and uncovering hidden structures in real-world data tensors. Unlike conventional deterministic tensor decomposition algorithms, randomized methods offer higher efficiency by reducing memory requirements and computational complexity. This paper proposes an efficient hardware architecture for a randomized tensor decomposition implemented on a field-programmable gate array (FPGA) using high-level synthesis (HLS). The proposed architecture integrates random projection, power iteration, and subspace approximation via QR decomposition to achieve low-rank approximation of multidimensional datasets. The proposed architecture utilizes the capabilities of reconfigurable systems to accelerate tensor computation. It includes three central units: (1) tensor times matrix chain (TTMc), (2) tensor unfolding unit, and (3) QR decomposition unit to implement a three-stage algorithm. Experimental results demonstrate that our FPGA design achieves up to 14.56 times speedup compared to the well-implemented tensor decomposition using software library Tensor Toolbox on an Intel i7-9700 CPU. For a large input tensor of size $$512 \times 512 \times 512$$ 512 × 512 × 512 , the proposed design achieves a 5.55 times speedup compared to an Nvidia Tesla T4 GPU. Furthermore, we utilize our hardware-based high-order singular value decomposition (HOSVD) accelerator for two real applications: background subtraction of dynamic video datasets and data compression. In both applications, our proposed design shows high efficiency regarding accuracy and computational time.

7 March 2026 in Neurocomputing
Verified
Journal Article
Closed access
XMXinmin Meng
Xinmin Meng
MAmuhammad Ashraf Abdelhamid ABDELGAWAD
muhammad Ashraf Abdelhamid ABDELGAWAD
PJPeng Jing
Peng Jing
RCRay C.C. Cheung
Ray C.C. Cheung
HYHong Yan
Hong Yan