Hien M. Nguyen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hien M. Nguyen has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
Gary H. Glover
Lucas Center for MR Spectroscopy and Imaging, Department of Radiology, Stanford University, USA
1 shared publicationJingyuan Chen
Martinos Center for Biomedical Imaging, Massachusetts General Hospital, Harvard Medical School, USA
1 shared publication- Nam H. Lee
College of Engineering, University of Iowa, Iowa City, IA 52242, USA
1 shared publication Son B. Dinh
Vietnamese-German University, Binh Duong, Vietnam
1 shared publication
Latest Publications
- 31 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Biomedical Engineering
- Vol. 69 (10) , 3193-3204
Morphological Component Analysis of Functional MRI Brain Networks
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.
- 31 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Biomedical Engineering
- Vol. 69 (10) , 3193-3204
Morphological Component Analysis of Functional MRI Brain Networks
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
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 29-34
Accelerating GenSeT Reconstruction for Sparsely Sampled DCE-MRI with GPU
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.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 29-34
Accelerating GenSeT Reconstruction for Sparsely Sampled DCE-MRI with GPU
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.