Reconstruction of Undersampled Big Dynamic MRI Data Using Non-Convex Low-Rank and Sparsity Constraints

Dynamic magnetic resonance imaging (MRI) has been extensively utilized for enhancing medical living environment visualization, however, in clinical practice it often suffers from long data acquisition times. Dynamic imaging essentially reconstructs the visual image from raw (k,t)-space measurements,...

Full description

Bibliographic Details
Main Authors: Ryan Wen Liu, Lin Shi, Simon Chun Ho Yu, Naixue Xiong, Defeng Wang
Format: Article
Language:English
Published: MDPI AG 2017-03-01
Series:Sensors
Subjects:
Online Access:http://www.mdpi.com/1424-8220/17/3/509
id doaj-1a11e6360ff94abd91b00002f1a4ead6
record_format Article
spelling doaj-1a11e6360ff94abd91b00002f1a4ead62020-11-24T21:06:14ZengMDPI AGSensors1424-82202017-03-0117350910.3390/s17030509s17030509Reconstruction of Undersampled Big Dynamic MRI Data Using Non-Convex Low-Rank and Sparsity ConstraintsRyan Wen Liu0Lin Shi1Simon Chun Ho Yu2Naixue Xiong3Defeng Wang4Department of Imaging and Interventional Radiology, The Chinese University of Hong Kong, Shatin 999077, N.T., Hong Kong, ChinaDepartment of Medicine and Therapeutics, The Chinese University of Hong Kong, Shatin 999077, N.T., Hong Kong, ChinaDepartment of Imaging and Interventional Radiology, The Chinese University of Hong Kong, Shatin 999077, N.T., Hong Kong, ChinaDepartment of Mathematics and Computer Science, Northeastern State University, Tahlequah, OK 74464, USADepartment of Imaging and Interventional Radiology, The Chinese University of Hong Kong, Shatin 999077, N.T., Hong Kong, ChinaDynamic magnetic resonance imaging (MRI) has been extensively utilized for enhancing medical living environment visualization, however, in clinical practice it often suffers from long data acquisition times. Dynamic imaging essentially reconstructs the visual image from raw (k,t)-space measurements, commonly referred to as big data. The purpose of this work is to accelerate big medical data acquisition in dynamic MRI by developing a non-convex minimization framework. In particular, to overcome the inherent speed limitation, both non-convex low-rank and sparsity constraints were combined to accelerate the dynamic imaging. However, the non-convex constraints make the dynamic reconstruction problem difficult to directly solve through the commonly-used numerical methods. To guarantee solution efficiency and stability, a numerical algorithm based on Alternating Direction Method of Multipliers (ADMM) is proposed to solve the resulting non-convex optimization problem. ADMM decomposes the original complex optimization problem into several simple sub-problems. Each sub-problem has a closed-form solution or could be efficiently solved using existing numerical methods. It has been proven that the quality of images reconstructed from fewer measurements can be significantly improved using non-convex minimization. Numerous experiments have been conducted on two in vivo cardiac datasets to compare the proposed method with several state-of-the-art imaging methods. Experimental results illustrated that the proposed method could guarantee the superior imaging performance in terms of quantitative and visual image quality assessments.http://www.mdpi.com/1424-8220/17/3/509compressed sensingdynamic magnetic resonance imaginglow-ranknon-convex optimizationrobust principal component analysis
collection DOAJ
language English
format Article
sources DOAJ
author Ryan Wen Liu
Lin Shi
Simon Chun Ho Yu
Naixue Xiong
Defeng Wang
spellingShingle Ryan Wen Liu
Lin Shi
Simon Chun Ho Yu
Naixue Xiong
Defeng Wang
Reconstruction of Undersampled Big Dynamic MRI Data Using Non-Convex Low-Rank and Sparsity Constraints
Sensors
compressed sensing
dynamic magnetic resonance imaging
low-rank
non-convex optimization
robust principal component analysis
author_facet Ryan Wen Liu
Lin Shi
Simon Chun Ho Yu
Naixue Xiong
Defeng Wang
author_sort Ryan Wen Liu
title Reconstruction of Undersampled Big Dynamic MRI Data Using Non-Convex Low-Rank and Sparsity Constraints
title_short Reconstruction of Undersampled Big Dynamic MRI Data Using Non-Convex Low-Rank and Sparsity Constraints
title_full Reconstruction of Undersampled Big Dynamic MRI Data Using Non-Convex Low-Rank and Sparsity Constraints
title_fullStr Reconstruction of Undersampled Big Dynamic MRI Data Using Non-Convex Low-Rank and Sparsity Constraints
title_full_unstemmed Reconstruction of Undersampled Big Dynamic MRI Data Using Non-Convex Low-Rank and Sparsity Constraints
title_sort reconstruction of undersampled big dynamic mri data using non-convex low-rank and sparsity constraints
publisher MDPI AG
series Sensors
issn 1424-8220
publishDate 2017-03-01
description Dynamic magnetic resonance imaging (MRI) has been extensively utilized for enhancing medical living environment visualization, however, in clinical practice it often suffers from long data acquisition times. Dynamic imaging essentially reconstructs the visual image from raw (k,t)-space measurements, commonly referred to as big data. The purpose of this work is to accelerate big medical data acquisition in dynamic MRI by developing a non-convex minimization framework. In particular, to overcome the inherent speed limitation, both non-convex low-rank and sparsity constraints were combined to accelerate the dynamic imaging. However, the non-convex constraints make the dynamic reconstruction problem difficult to directly solve through the commonly-used numerical methods. To guarantee solution efficiency and stability, a numerical algorithm based on Alternating Direction Method of Multipliers (ADMM) is proposed to solve the resulting non-convex optimization problem. ADMM decomposes the original complex optimization problem into several simple sub-problems. Each sub-problem has a closed-form solution or could be efficiently solved using existing numerical methods. It has been proven that the quality of images reconstructed from fewer measurements can be significantly improved using non-convex minimization. Numerous experiments have been conducted on two in vivo cardiac datasets to compare the proposed method with several state-of-the-art imaging methods. Experimental results illustrated that the proposed method could guarantee the superior imaging performance in terms of quantitative and visual image quality assessments.
topic compressed sensing
dynamic magnetic resonance imaging
low-rank
non-convex optimization
robust principal component analysis
url http://www.mdpi.com/1424-8220/17/3/509
work_keys_str_mv AT ryanwenliu reconstructionofundersampledbigdynamicmridatausingnonconvexlowrankandsparsityconstraints
AT linshi reconstructionofundersampledbigdynamicmridatausingnonconvexlowrankandsparsityconstraints
AT simonchunhoyu reconstructionofundersampledbigdynamicmridatausingnonconvexlowrankandsparsityconstraints
AT naixuexiong reconstructionofundersampledbigdynamicmridatausingnonconvexlowrankandsparsityconstraints
AT defengwang reconstructionofundersampledbigdynamicmridatausingnonconvexlowrankandsparsityconstraints
_version_ 1716766259814596608