An Algorithm Combining Analysis-based Blind Compressed Sensing and Nonlocal Low-rank Constraints for MRI Reconstruction

Author(s):  
Mei Sun ◽  
Jinxu Tao ◽  
Zhongfu Ye ◽  
Bensheng Qiu ◽  
Jinzhang Xu ◽  
...  

Background: In order to overcome the limitation of long scanning time, compressive sensing (CS) technology exploits the sparsity of image in some transform domain to reduce the amount of acquired data. Therefore, CS has been widely used in magnetic resonance imaging (MRI) reconstruction. </P><P> Discussion: Blind compressed sensing enables to recover the image successfully from highly under- sampled measurements, because of the data-driven adaption of the unknown transform basis priori. Moreover, analysis-based blind compressed sensing often leads to more efficient signal reconstruction with less time than synthesis-based blind compressed sensing. Recently, some experiments have shown that nonlocal low-rank property has the ability to preserve the details of the image for MRI reconstruction. Methods: Here, we focus on analysis-based blind compressed sensing, and combine it with additional nonlocal low-rank constraint to achieve better MR images from fewer measurements. Instead of nuclear norm, we exploit non-convex Schatten p-functionals for the rank approximation. </P><P> Results & Conclusion: Simulation results indicate that the proposed approach performs better than the previous state-of-the-art algorithms.

2019 ◽  
Vol 9 (6) ◽  
pp. 1066-1075 ◽  
Author(s):  
Fanfan Zeng ◽  
Hongwei Du ◽  
Jiaquan Jin ◽  
Jinzhang Xu ◽  
Bensheng Qiu

Compressed sensing (CS) is a technique to reconstruct images from undersampling data, reducing the scanning time of magnetic resonance imaging (MRI). It utilizes the sparsity of images in some transform domains. Total variation (TV) has been applied to enforce sparsity. However, traditional TV based on the l1-norm is not the most direct way to induce sparsity, and it cannot offer a sufficiently sparse representation. Since the lp-norm (0< p < 1) promotes the sparsity better than that of the l1-norm, we propose two extended TV algorithms based on the lp-norm: anisotropic and isotropic total p-variation (TpV). Then we introduce them to the MRI reconstruction model. We apply the Bregman iteration technique to handle the proposed optimization problem. During the iteration, the p-shrinkage operator is employed to resolve the nonconvex problem caused by the lp-norm. Experimental results illustrate that our algorithms could offer the higher SNR and lower relative error compared with traditional TV algorithms and high-degree TV (HDTV) algorithm in MRI reconstruction problem.


2017 ◽  
Vol 10 (4) ◽  
pp. 895-912 ◽  
Author(s):  
Tingting Wu ◽  
David Z. W. Wang ◽  
Zhengmeng Jin ◽  
Jun Zhang

AbstractHigh order total variation (TV2) and ℓ1 based (TV2L1) model has its advantage over the TVL1 for its ability in avoiding the staircase; and a constrained model has the advantage over its unconstrained counterpart for simplicity in estimating the parameters. In this paper, we consider solving the TV2L1 based magnetic resonance imaging (MRI) signal reconstruction problem by an efficient alternating direction method of multipliers. By sufficiently utilizing the problem's special structure, we manage to make all subproblems either possess closed-form solutions or can be solved via Fast Fourier Transforms, which makes the cost per iteration very low. Experimental results for MRI reconstruction are presented to illustrate the effectiveness of the new model and algorithm. Comparisons with its recent unconstrained counterpart are also reported.


2016 ◽  
Vol 24 (s2) ◽  
pp. S593-S599 ◽  
Author(s):  
Jianping Huang ◽  
Lihui Wang ◽  
Chunyu Chu ◽  
Yanli Zhang ◽  
Wanyu Liu ◽  
...  

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.


2015 ◽  
Vol 2015 ◽  
pp. 1-5
Author(s):  
Zhenyu Hu ◽  
Qiuye Wang ◽  
Congcong Ming ◽  
Lai Wang ◽  
Yuanqing Hu ◽  
...  

Compressed sensing (CS) based methods have recently been used to reconstruct magnetic resonance (MR) images from undersampled measurements, which is known as CS-MRI. In traditional CS-MRI, wavelet transform can hardly capture the information of image curves and edges. In this paper, we present a new CS-MRI reconstruction algorithm based on contourlet transform and alternating direction method (ADM). The MR images are firstly represented by contourlet transform, which can describe the images’ curves and edges fully and accurately. Then the MR images are reconstructed by ADM, which is an effective CS reconstruction method. Numerical results validate the superior performance of the proposed algorithm in terms of reconstruction accuracy and computation time.


2021 ◽  
Vol 54 (7) ◽  
pp. 103-107
Author(s):  
Antonio Fazzi ◽  
Nicola Guglielmi ◽  
Ivan Markovsky ◽  
Konstantin Usevich

Nukleonika ◽  
2016 ◽  
Vol 61 (1) ◽  
pp. 41-43 ◽  
Author(s):  
Łukasz Błaszczyk

Abstract In magnetic resonance imaging (MRI), k-space sampling, due to physical restrictions, is very time-consuming. It cannot be much improved using classical Nyquist-based sampling theory. Recent developments utilize the fact that MR images are sparse in some representations (i.e. wavelet coefficients). This new theory, created by Candès and Romberg, called compressed sensing (CS), shows that images with sparse representations can be recovered from randomly undersampled k-space data, by using nonlinear reconstruction algorithms (i.e. l1-norm minimization). Throughout this paper, mathematical preliminaries of CS are outlined, in the form introduced by Candès. We describe the main conditions for measurement matrices and recovery algorithms and present a basic example, showing that while the method really works (reducing the time of MR examination), there are some major problems that need to be taken into consideration.


Author(s):  
Davi Marco Lyra-Leite ◽  
Joao Paulo Carvalho Lustosa da Costa ◽  
Joao Luiz Azevedo de Carvalho

Sign in / Sign up

Export Citation Format

Share Document