Hien M. Nguyen

Hien M. Nguyen

Auto-generated profile, based on publicly available information

Hien M. Nguyen

Vietnamese-German University, Faculty of Engineering, Binh Duong, Vietnam

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
31 March 2022 in IEEE Transactions on Biomedical Engineering
Verified
Journal Article
Closed access
HNHien M. Nguyen
Hien M. Nguyen
JCJingyuan Chen
Jingyuan Chen
GGGary H. Glover
Gary H. Glover
Objective: Sparse representations have been utilized to identify functional connectivity (FC) of networks, while ICA employs the assumption of independence among the network sources to demonstrate FC. Here, we investigate a sparse decomposition method based on Morphological Component Analysis and K-SVD dictionary learning — MCA-KSVD — and contrast the effect of the sparsity constraint vs. the independency constraint on FC and denoising. Methods: Using a K-SVD algorithm, fMRI signals are decomposed into morphological components which have sparse spatial overlap. We present simulations when the independency assumption of ICA fails and MCA-KSVD recovers more accurate spatial-temporal structures. Denoising performance of both methods is investigated at various noise levels. A comprehensive experimental study was conducted on resting-state and task fMRI. Results: Validations show that ICA is advantageous when network components are well-separated and sparse. In such cases, the MCA-KSVD method has modest value over ICA in terms of network delineation but is significantly more effective in reducing spatial and temporal noise. Results demonstrate that the sparsity constraint yields sparser networks with higher spatial resolution while suppressing weak signals. Temporally, this localization effect yields higher contrast-to-noise ratios (CNRs) of time series. Conclusion: While marginally improving the spatial decomposition, MCA-KSVD denoises fMRI data much more effectively than ICA, preserving network structures and improving CNR, especially for weak networks. Significance: A sparsity-based decomposition approach may be useful for investigating functional connectivity in noisy cases. It may serve as an efficient decomposition method for reduced acquisition time and may prove useful for detecting weak network activations.

1 December 2018
Verified
Conference Paper
Closed access
SDSon B. Dinh
Son B. Dinh
NLNam Le
Nam Le
HNHien M. Nguyen
Hien M. Nguyen
Dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) uses radioactive contrast agents as a tracer to provide tumor morphology and contrast kinetics information of tumor regions, which are crucial in breast cancer diagnosis and treatment. The effectiveness of the imaging modality relies on its capacity to acquire dynamic data at a sufficient sampling rate to gain the desired temporal resolution. This can be achieved by sparsely sampling the k-space data and applying advanced image reconstruction method that exploits compressed sensing, such as the recently proposed GenSeT (Generalized Series with Temporal constraint) method. Due to the highly nonlinear nature of compressed-sensing-based approach, computational complexity of the reconstruction algorithm is a practical challenge, especially for large breast DCE-MRI datasets. In this study, the GenSeT algorithm was implemented in GPU using CUDA platform to significantly reduce reconstruction time, yielding a much more practical solution. Experimental results showed that for a breast DCE-MRI data, the proposed GPU-based GenSeT implementation achieved approximately 48 times faster in the reconstruction time as compared to the CPU approach, without sacrificing the image quality. Although this work focuses on accelerating image reconstruction for sparsely-sampled breast DCE-MRI, the proposed GPU-based algorithm can be easily applied for sparsely sampled DCE-MRI of other organs.