Low-Rank and Sparse Decomposition Model for Accelerating Dynamic MRI Reconstruction

Bayesian Dictionary Learning on Robust Tubal Transformed Tensor Factorization

The recent study on tensor singular value decomposition (t-SVD) that performs the Fourier transform on the tubes of a third-order tensor has gained promising performance on multidimensional data recovery problems. However, such a fixed transformation, e.g., discrete Fourier transform and discrete cosine transform, lacks being self-adapted to the change of different datasets, and thus, it is not flexible enough to exploit the low-rank and sparse property of the variety of multidimensional datasets. In this article, we consider a tube as an atom of a third-order tensor and construct a data-driven learning dictionary from the observed noisy data along the tubes of the given tensor. Then, a Bayesian dictionary learning (DL) model with tensor tubal transformed factorization, aiming to identify the underlying low-tubal-rank structure of the tensor effectively via the data-adaptive dictionary, is developed to solve the tensor robust principal component analysis (TRPCA) problem. With the defined pagewise tensor operators, a variational Bayesian DL algorithm is established and updates the posterior distributions instantaneously along the third dimension to solve the TPRCA. Extensive experiments on real-world applications, such as color image and hyperspectral image denoising and background/foreground separation problems, demonstrate both effectiveness and efficiency of the proposed approach in terms of various standard metrics.

Fourier Domain Robust Denoising Decomposition and Adaptive Patch MRI Reconstruction

The sparsity of the Fourier transform domain has been applied to magnetic resonance imaging (MRI) reconstruction in k -space. Although unsupervised adaptive patch optimization methods have shown promise compared to data-driven-based supervised methods, the following challenges exist in MRI reconstruction: 1) in previous k -space MRI reconstruction tasks, MRI with noise interference in the acquisition process is rarely considered. 2) Differences in transform domains should be resolved to achieve the high-quality reconstruction of low undersampled MRI data. 3) Robust patch dictionary learning problems are usually nonconvex and NP-hard, and alternate minimization methods are often computationally expensive. In this article, we propose a method for Fourier domain robust denoising decomposition and adaptive patch MRI reconstruction (DDAPR). DDAPR is a two-step optimization method for MRI reconstruction in the presence of noise and low undersampled data. It includes the low-rank and sparse denoising reconstruction model (LSDRM) and the robust dictionary learning reconstruction model (RDLRM). In the first step, we propose LSDRM for different domains. For the optimization solution, the proximal gradient method is used to optimize LSDRM by singular value decomposition and soft threshold algorithms. In the second step, we propose RDLRM, which is an effective adaptive patch method by introducing a low-rank and sparse penalty adaptive patch dictionary and using a sparse rank-one matrix to approximate the undersampled data. Then, the block coordinate descent (BCD) method is used to optimize the variables. The BCD optimization process involves valid closed-form solutions. Extensive numerical experiments show that the proposed method has a better performance than previous methods in image reconstruction based on compressed sensing or deep learning.

Accelerated respiratory-resolved 4D-MRI with separable spatio-temporal neural networks

BACKGROUND

Respiratory-resolved four-dimensional magnetic resonance imaging (4D-MRI) provides essential motion information for accurate radiation treatments of mobile tumors. However, obtaining high-quality 4D-MRI suffers from long acquisition and reconstruction times.

PURPOSE

To develop a deep learning architecture to quickly acquire and reconstruct high-quality 4D-MRI, enabling accurate motion quantification for MRI-guided radiotherapy (MRIgRT).

METHODS

A small convolutional neural network called MODEST is proposed to reconstruct 4D-MRI by performing a spatial and temporal decomposition, omitting the need for 4D convolutions to use all the spatio-temporal information present in 4D-MRI. This network is trained on undersampled 4D-MRI after respiratory binning to reconstruct high-quality 4D-MRI obtained by compressed sensing reconstruction. The network is trained, validated, and tested on 4D-MRI of 28 lung cancer patients acquired with a T1-weighted golden-angle radial stack-of-stars (GA-SOS) sequence. The 4D-MRI of 18, 5, and 5 patients were used for training, validation, and testing. Network performances are evaluated on image quality measured by the structural similarity index (SSIM) and motion consistency by comparing the position of the lung-liver interface on undersampled 4D-MRI before and after respiratory binning. The network is compared to conventional architectures such as a U-Net, which has 30 times more trainable parameters.

RESULTS

MODEST can reconstruct high-quality 4D-MRI with higher image quality than a U-Net, despite a thirty-fold reduction in trainable parameters. High-quality 4D-MRI can be obtained using MODEST in approximately 2.5 min, including acquisition, processing, and reconstruction.

CONCLUSION

High-quality accelerated 4D-MRI can be obtained using MODEST, which is particularly interesting for MRIgRT.

Cardiac MR: From Theory to Practice

Cardiovascular disease (CVD) is the leading single cause of morbidity and mortality, causing over 17. 9 million deaths worldwide per year with associated costs of over $800 billion. Improving prevention, diagnosis, and treatment of CVD is therefore a global priority. Cardiovascular magnetic resonance (CMR) has emerged as a clinically important technique for the assessment of cardiovascular anatomy, function, perfusion, and viability. However, diversity and complexity of imaging, reconstruction and analysis methods pose some limitations to the widespread use of CMR. Especially in view of recent developments in the field of machine learning that provide novel solutions to address existing problems, it is necessary to bridge the gap between the clinical and scientific communities. This review covers five essential aspects of CMR to provide a comprehensive overview ranging from CVDs to CMR pulse sequence design, acquisition protocols, motion handling, image reconstruction and quantitative analysis of the obtained data. (1) The basic MR physics of CMR is introduced. Basic pulse sequence building blocks that are commonly used in CMR imaging are presented. Sequences containing these building blocks are formed for parametric mapping and functional imaging techniques. Commonly perceived artifacts and potential countermeasures are discussed for these methods. (2) CMR methods for identifying CVDs are illustrated. Basic anatomy and functional processes are described to understand the cardiac pathologies and how they can be captured by CMR imaging. (3) The planning and conduct of a complete CMR exam which is targeted for the respective pathology is shown. Building blocks are illustrated to create an efficient and patient-centered workflow. Further strategies to cope with challenging patients are discussed. (4) Imaging acceleration and reconstruction techniques are presented that enable acquisition of spatial, temporal, and parametric dynamics of the cardiac cycle. The handling of respiratory and cardiac motion strategies as well as their integration into the reconstruction processes is showcased. (5) Recent advances on deep learning-based reconstructions for this purpose are summarized. Furthermore, an overview of novel deep learning image segmentation and analysis methods is provided with a focus on automatic, fast and reliable extraction of biomarkers and parameters of clinical relevance.

An enforced block diagonal low-rank representation method for the classification of medical image patterns

Low-rank representation based methods have been used on a variety of medical imaging databases for the segmentation and classification of biomedical images. The subspace segmentation of the data is performed by generating the block diagonal coefficient matrix. Whereas, the data is classified by performing the partitioning of the low-rank representation matrix. There exist several such methods for analysing medical images. The major difference between them lies in the construction of the data dictionary. Most of the time, the input data pattern is used as the dictionary for learning the representation matrix. The direct use of the input data for learning the representation degrades the performance of the model because medical images are subjected to outliers of multiple types, which include environmental lighting, image appearance and varying illumination. These types of errors induce noise in the data. It has been observed that the representation-based model is robust when the training data is clean. If the training data contains corrupted subsamples, the performance of the model drops down. We have addressed the mentioned problem by adopting a class-wise dictionary learning approach. In which the pattern of each class is learnt as the set of tuples in the dictionary. The model has been evaluated on several medical imaging datasets, which includes the Break-his dataset, ALL-IDB, biomedical images, covid CT and chest X-ray. The classification performance of the model is best for the biomedical database (99.16%) followed by the Covid dataset (94%), ALL-IDB database (93.47%) and Break-his dataset (93%).

Low-Rank and Framelet Based Sparsity Decomposition for Interventional MRI Reconstruction

OBJECTIVE

Interventional MRI (i-MRI) is crucial for MR image-guided therapy. Current image reconstruction methods for dynamic MR imaging are mostly retrospective that may not be suitable for i-MRI in real-time. Therefore, an algorithm to reconstruct images without a temporal pattern as in dynamic imaging is needed for i-MRI.

METHODS

We proposed a low-rank and sparsity (LS) decomposition algorithm with framelet transform to reconstruct the interventional feature with a high temporal resolution. Different from the existing LS based algorithm, the spatial sparsity of both the low-rank and sparsity components was used. We also used a primal dual fixed point (PDFP) method for optimization of the objective function to avoid solving sub-problems. Intervention experiments with gelatin and brain phantoms were carried out for validation.

RESULTS

The LS decomposition with framelet transform and PDFP could provide the best reconstruction performance compared with those without. Satisfying reconstruction results were obtained with only 10 radial spokes for a temporal resolution of 60 ms.

CONCLUSION AND SIGNIFICANCE

The proposed method has the potential for i-MRI in many different application scenarios.

Improvement of Fast Model-Based Acceleration of Parameter Look-Locker T1 Mapping

Quantitative mapping is desirable in many scientific and clinical magneric resonance imaging (MRI) applications. Recent inverse recovery-look locker sequence enables single-shot T₁ mapping with a time of a few seconds but the main computational load is directed into offline reconstruction, which can take from several minutes up to few hours. In this study we proposed improvement of model-based approach for T₁-mapping by introduction of two steps fitting procedure. We provided analysis of further reduction of k-space data, which lead us to decrease of computational time and perform simulation of multi-slice development. The region of interest (ROI) analysis of human brain measurements with two different initial models shows that the differences between mean values with respect to a reference approach are in white matter-0.3% and 1.1%, grey matter-0.4% and 1.78% and cerebrospinal fluid-2.8% and 11.1% respectively. With further improvements we were able to decrease the time of computational of single slice to 6.5 min and 23.5 min for different initial models, which has been already not achieved by any other algorithm. In result we obtained an accelerated novel method of model-based image reconstruction in which single iteration can be performed within few seconds on home computer.

Reconstruction techniques for cardiac cine MRI

The present survey describes the state-of-the-art techniques for dynamic cardiac magnetic resonance image reconstruction. Additionally, clinical relevance, main challenges, and future trends of this image modality are outlined. Thus, this paper aims to provide a general vision about cine MRI as the standard procedure in functional evaluation of the heart, focusing on technical methodologies.