scholarly journals Quality-Aware Cine Cardiac MRI Reconstruction and Analysis from Undersampled K-Space Data

Author(s):  
Inês Machado ◽  
Esther Puyol-Antón ◽  
Kerstin Hammernik ◽  
Gastão Cruz ◽  
Devran Ugurlu ◽  
...  
2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Xianchao Xiu ◽  
Lingchen Kong

It is challenging and inspiring for us to achieve high spatiotemporal resolutions in dynamic cardiac magnetic resonance imaging (MRI). In this paper, we introduce two novel models and algorithms to reconstruct dynamic cardiac MRI data from under-sampledk-tspace data. In contrast to classical low-rank and sparse model, we use rank-one and transformed sparse model to exploit the correlations in the dataset. In addition, we propose projected alternative direction method (PADM) and alternative hard thresholding method (AHTM) to solve our proposed models. Numerical experiments of cardiac perfusion and cardiac cine MRI data demonstrate improvement in performance.


2006 ◽  
Vol 2006 ◽  
pp. 1-9 ◽  
Author(s):  
Jiayu Song ◽  
Qing Huo Liu

Non-Cartesian sampling is widely used for fast magnetic resonance imaging (MRI). Accurate and fast image reconstruction from non-Cartesiank-space data becomes a challenge and gains a lot of attention. Images provided by conventional direct reconstruction methods usually bear ringing, streaking, and other leakage artifacts caused by discontinuous structures. In this paper, we tackle these problems by analyzing the principal point spread function (PSF) of non-Cartesian reconstruction and propose a leakage reduction reconstruction scheme based on discontinuity subtraction. Data fidelity ink-space is enforced during each iteration. Multidimensional nonuniform fast Fourier transform (NUFFT) algorithms are utilized to simulate thek-space samples as well as to reconstruct images. The proposed method is compared to the direct reconstruction method on computer-simulated phantoms and physical scans. Non-Cartesian sampling trajectories including 2D spiral, 2D and 3D radial trajectories are studied. The proposed method is found useful on reducing artifacts due to high image discontinuities. It also improves the quality of images reconstructed from undersampled data.


2020 ◽  
Vol 34 (01) ◽  
pp. 792-799 ◽  
Author(s):  
Wentian Li ◽  
Xidong Feng ◽  
Haotian An ◽  
Xiang Yao Ng ◽  
Yu-Jin Zhang

Compressed sensing magnetic resonance imaging (CS-MRI) is a technique aimed at accelerating the data acquisition of MRI. While down-sampling in k-space proportionally reduces the data acquisition time, it results in images corrupted by aliasing artifacts and blur. To reconstruct images from the down-sampled k-space, recent deep-learning based methods have shown better performance compared with classical optimization-based CS-MRI methods. However, they usually use deep neural networks as a black-box, which directly maps the corrupted images to the target images from fully-sampled k-space data. This lack of transparency may impede practical usage of such methods. In this work, we propose a deep reinforcement learning based method to reconstruct the corrupted images with meaningful pixel-wise operations (e.g. edge enhancing filters), so that the reconstruction process is transparent to users. Specifically, MRI reconstruction is formulated as Markov Decision Process with discrete actions and continuous action parameters. We conduct experiments on MICCAI dataset of brain tissues and fastMRI dataset of knee images. Our proposed method performs favorably against previous approaches. Our trained model learns to select pixel-wise operations that correspond to the anatomical structures in the MR images. This makes the reconstruction process more interpretable, which would be helpful for further medical analysis.


2020 ◽  
Vol 10 (5) ◽  
pp. 1816 ◽  
Author(s):  
Zaccharie Ramzi ◽  
Philippe Ciuciu ◽  
Jean-Luc Starck

Deep learning is starting to offer promising results for reconstruction in Magnetic Resonance Imaging (MRI). A lot of networks are being developed, but the comparisons remain hard because the frameworks used are not the same among studies, the networks are not properly re-trained, and the datasets used are not the same among comparisons. The recent release of a public dataset, fastMRI, consisting of raw k-space data, encouraged us to write a consistent benchmark of several deep neural networks for MR image reconstruction. This paper shows the results obtained for this benchmark, allowing to compare the networks, and links the open source implementation of all these networks in Keras. The main finding of this benchmark is that it is beneficial to perform more iterations between the image and the measurement spaces compared to having a deeper per-space network.


Author(s):  
Yuchou Chang ◽  
Mert Saritac

Abstract Magnetic resonance imaging (MRI) has revolutionized the radiology. As a leading medical imaging modality, MRI not only visualizes the structures inside body, but also produces functional imaging. However, due to the slow imaging speed constrained by the MR physics, MRI cost is expensive, and patient may feel not comfortable in a scanner for a long time. Parallel MRI has accelerated the imaging speed through the sub-Nyquist sampling strategy and the missing data are interpolated by the multiple coil data acquired. Kernel learning has been used in the parallel MRI reconstruction to learn the interpolation weights and re-construct the undersampled data. However, noise and aliasing artifacts still exist in the reconstructed image and a large number of auto-calibration signal lines are needed. To further improve the kernel learning-based MRI reconstruction and accelerate the speed, this paper proposes a group feature selection strategy to improve the learning performance and enhance the reconstruction quality. An explicit kernel mapping is used for selecting a subset of features which contribute most to estimate the missing k-space data. The experimental results show that the learning behaviours can be better predicted and therefore the reconstructed image quality is improved.


2015 ◽  
Vol 2015 ◽  
pp. 1-18 ◽  
Author(s):  
Min Yuan ◽  
Bingxin Yang ◽  
Yide Ma ◽  
Jiuwen Zhang ◽  
Runpu Zhang ◽  
...  

Compressed sensing has shown great potential in speeding up MR imaging by undersamplingk-space data. Generally sparsity is used as a priori knowledge to improve the quality of reconstructed image. Compressed sensing MR image (CS-MRI) reconstruction methods have employed widely used sparsifying transforms such as wavelet or total variation, which are not preeminent in dealing with MR images containing distributed discontinuities and cannot provide a sufficient sparse representation and the decomposition at any direction. In this paper, we propose a novel CS-MRI reconstruction method from highly undersampledk-space data using nonsubsampled shearlet transform (NSST) sparsity prior. In particular, we have implemented a flexible decomposition with an arbitrary even number of directional subbands at each level using NSST for MR images. The highly directional sensitivity of NSST and its optimal approximation properties lead to improvement in CS-MRI reconstruction applications. The experimental results demonstrate that the proposed method results in the high quality reconstruction, which is highly effective at preserving the intrinsic anisotropic features of MRI meanwhile suppressing the artifacts and added noise. The objective evaluation indices outperform all compared CS-MRI methods. In summary, NSST with even number directional decomposition is very competitive in CS-MRI applications as sparsity prior in terms of performance and computational efficiency.


In this paper an efficient method for the reconstruction of Magnetic Resonance Image (MRI) from the compressively sampled MR k-space. Compressive Sensing (CS) gives an efficient structure for getting back the signal or image from lesser measurements than that are really necessary according to the Nyquist criterion. The Walsh Hadamard transform is used as the sparsifying transform. In the proposed work radial and Cartesian sampling patterns are applied on k-space to collect minimum samples and MR image is recovered by taking Inverse Fourier transform of the k-space data . The Qualitative and quantitative analysis of the reconstructed images depict that the performance of Walsh Hadamard Transform as sparsifying transform gives better result in comparison with DFT. Experiments conducted on the MR Images of brain and knee show that proposed method gene-rates good quality images


Sign in / Sign up

Export Citation Format

Share Document