scholarly journals Compressed Sensing MRI Reconstruction with Multiple Sparsity Constraints on Radial Sampling

2019 ◽  
Vol 2019 ◽  
pp. 1-14 ◽  
Author(s):  
Jianping Huang ◽  
Lihui Wang ◽  
Yuemin Zhu

Compressed Sensing Magnetic Resonance Imaging (CS-MRI) is a promising technique for accelerating MRI acquisitions by using fewer k-space data. Exploiting more sparsity is an important approach to improving the CS-MRI reconstruction quality. We propose a novel CS-MRI framework based on multiple sparse priors to increase reconstruction accuracy. The wavelet sparsity, wavelet tree structured sparsity, and nonlocal total variation (NLTV) regularizations were integrated in the CS-MRI framework, and the optimization problem was solved using a fast composite splitting algorithm (FCSA). The proposed method was evaluated on different types of MR images with different radial sampling schemes and different sampling ratios and compared with the state-of-the-art CS-MRI reconstruction methods in terms of peak signal-to-noise ratio (PSNR), feature similarity (FSIM), relative l2 norm error (RLNE), and mean structural similarity (MSSIM). The results demonstrated that the proposed method outperforms the traditional CS-MRI algorithms in both visual and quantitative comparisons.

MR imaging method is widely used for diagnosis applications. The echo signal received from the MR scanning machine is used to generate the image. The data acquisition and reconstruction are the important operations. In this paper the kspace is compressively sampled using Radial Sampling pattern for acquiring the k-space data and Particle Swarm Optimization (PSO) with Total Variation (TV) is used as the reconstruction algorithm for the faithful reconstruction of MR image. The experiments are conducted on MR images of Brain, Head Angiogram and Shoulder images. Performance of the proposed method of reconstruction is analyzed for different sampling kspace scanning percentages. The reconstruction results are compared with the standard sampling pattern used for compressive sampling prove the novelty of the proposed method. The results are verified in terms of Peak Signal to Noise Ratio (PSNR), Mean Squared Error (MSE) and Structural Similarity index (SSIM).


2020 ◽  
Vol 14 ◽  
Author(s):  
Zhenmou Yuan ◽  
Mingfeng Jiang ◽  
Yaming Wang ◽  
Bo Wei ◽  
Yongming Li ◽  
...  

Research on undersampled magnetic resonance image (MRI) reconstruction can increase the speed of MRI imaging and reduce patient suffering. In this paper, an undersampled MRI reconstruction method based on Generative Adversarial Networks with the Self-Attention mechanism and the Relative Average discriminator (SARA-GAN) is proposed. In our SARA-GAN, the relative average discriminator theory is applied to make full use of the prior knowledge, in which half of the input data of the discriminator is true and half is fake. At the same time, a self-attention mechanism is incorporated into the high-layer of the generator to build long-range dependence of the image, which can overcome the problem of limited convolution kernel size. Besides, spectral normalization is employed to stabilize the training process. Compared with three widely used GAN-based MRI reconstruction methods, i.e., DAGAN, DAWGAN, and DAWGAN-GP, the proposed method can obtain a higher peak signal-to-noise ratio (PSNR) and structural similarity index measure(SSIM), and the details of the reconstructed image are more abundant and more realistic for further clinical scrutinization and diagnostic tasks.


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.


2020 ◽  
Vol 10 (6) ◽  
pp. 1902
Author(s):  
Fumio Hashimoto ◽  
Kibo Ote ◽  
Takenori Oida ◽  
Atsushi Teramoto ◽  
Yasuomi Ouchi

Convolutional neural networks (CNNs) demonstrate excellent performance when employed to reconstruct the images obtained by compressed-sensing magnetic resonance imaging (CS-MRI). Our study aimed to enhance image quality by developing a novel iterative reconstruction approach that utilizes image-based CNNs and k-space correction to preserve original k-space data. In the proposed method, CNNs represent a priori information concerning image spaces. First, the CNNs are trained to map zero-filling images onto corresponding full-sampled images. Then, they recover the zero-filled part of the k-space data. Subsequently, k-space corrections, which involve the replacement of unfilled regions by original k-space data, are implemented to preserve the original k-space data. The above-mentioned processes are used iteratively. The performance of the proposed method was validated using a T2-weighted brain-image dataset, and experiments were conducted with several sampling masks. Finally, the proposed method was compared with other noniterative approaches to demonstrate its effectiveness. The aliasing artifacts in the reconstructed images obtained using the proposed approach were reduced compared to those using other state-of-the-art techniques. In addition, the quantitative results obtained in the form of the peak signal-to-noise ratio and structural similarity index demonstrated the effectiveness of the proposed method. The proposed CS-MRI method enhanced MR image quality with high-throughput examinations.


2014 ◽  
Vol 989-994 ◽  
pp. 3946-3951
Author(s):  
Xin Jin ◽  
Ming Feng Jiang ◽  
Jie Feng

Exploiting the sparsity of MR signals, Compressed Sensing MR imaging (CS-MRI) is one of the most promising approaches to reconstruct a MR image with good quality from highly under-sampled k-space data. The group sparse method, which exploits additional sparse representation of the spatial group structure, can promote the overall sparsity degree, thereby leading to better reconstruction performance. In this work, an efficient superpixel/group assignment method, simple linear iterative clustering (SLIC), is incorporated to CS-MRI studies. A variable splitting strategy and classic alternating direct method is employed to solve the group sparse problem. The results indicate that the proposed method is capable of achieving significant improvements in reconstruction accuracy when compared with the state-of-the-art reconstruction methods.


Author(s):  
Liqiong Zhang ◽  
Min Li ◽  
Xiaohua Qiu

To overcome the “staircase effect” while preserving the structural information such as image edges and textures quickly and effectively, we propose a compensating total variation image denoising model combining L1 and L2 norm. A new compensating regular term is designed, which can perform anisotropic and isotropic diffusion in image denoising, thus making up for insufficient diffusion in the total variation model. The algorithm first uses local standard deviation to distinguish neighborhood types. Then, the anisotropic diffusion based on L1 norm plays the role of edge protection in the strong edge region. The anisotropic and the isotropic diffusion simultaneously exist in the smooth region, so that the weak textures can be protected while overcoming the “staircase effect” effectively. The simulation experiments show that this method can effectively improve the peak signal-to-noise ratio and obtain the higher structural similarity index and the shorter running time.


2017 ◽  
Vol 2017 ◽  
pp. 1-13
Author(s):  
Shanshan Chen ◽  
Bensheng Qiu ◽  
Feng Zhao ◽  
Chao Li ◽  
Hongwei Du

Compressed sensing (CS) has been applied to accelerate magnetic resonance imaging (MRI) for many years. Due to the lack of translation invariance of the wavelet basis, undersampled MRI reconstruction based on discrete wavelet transform may result in serious artifacts. In this paper, we propose a CS-based reconstruction scheme, which combines complex double-density dual-tree discrete wavelet transform (CDDDT-DWT) with fast iterative shrinkage/soft thresholding algorithm (FISTA) to efficiently reduce such visual artifacts. The CDDDT-DWT has the characteristics of shift invariance, high degree, and a good directional selectivity. In addition, FISTA has an excellent convergence rate, and the design of FISTA is simple. Compared with conventional CS-based reconstruction methods, the experimental results demonstrate that this novel approach achieves higher peak signal-to-noise ratio (PSNR), larger signal-to-noise ratio (SNR), better structural similarity index (SSIM), and lower relative error.


2020 ◽  
Vol 9 (4) ◽  
pp. 1461-1467
Author(s):  
Indrarini Dyah Irawati ◽  
Sugondo Hadiyoso ◽  
Yuli Sun Hariyani

In this study, we proposed compressive sampling for MRI reconstruction based on sparse representation using multi-wavelet transformation. Comparing the performance of wavelet decomposition level, which are Level 1, Level 2, Level 3, and Level 4. We used gaussian random process to generate measurement matrix. The algorithm used to reconstruct the image is . The experimental results showed that the use of wavelet multi-level can generate higher compression ratio but requires a longer processing time. MRI reconstruction results based on the parameters of the peak signal to noise ratio (PSNR) and structural similarity index measure (SSIM) show that the higher the level of decomposition in wavelets, the value of both decreases.


2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Maria Murad ◽  
Abdul Jalil ◽  
Muhammad Bilal ◽  
Shahid Ikram ◽  
Ahmad Ali ◽  
...  

Magnetic Resonance Imaging (MRI) is an important yet slow medical imaging modality. Compressed sensing (CS) theory has enabled to accelerate the MRI acquisition process using some nonlinear reconstruction techniques from even 10% of the Nyquist samples. In recent years, interpolated compressed sensing (iCS) has further reduced the scan time, as compared to CS, by exploiting the strong interslice correlation of multislice MRI. In this paper, an improved efficient interpolated compressed sensing (EiCS) technique is proposed using radial undersampling schemes. The proposed efficient interpolation technique uses three consecutive slices to estimate the missing samples of the central target slice from its two neighboring slices. Seven different evaluation metrics are used to analyze the performance of the proposed technique such as structural similarity index measurement (SSIM), feature similarity index measurement (FSIM), mean square error (MSE), peak signal to noise ratio (PSNR), correlation (CORR), sharpness index (SI), and perceptual image quality evaluator (PIQE) and compared with the latest interpolation techniques. The simulation results show that the proposed EiCS technique has improved image quality and performance using both golden angle and uniform angle radial sampling patterns, with an even lower sampling ratio and maximum information content and using a more practical sampling scheme.


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.


Sign in / Sign up

Export Citation Format

Share Document