Efficient dual ADMMs for sparse compressive sensing MRI reconstruction
From MaRDI portal
Abstract: Magnetic Resonance Imaging (MRI) is a kind of medical imaging technology used for diagnostic imaging of diseases, but its image quality may be suffered by the long acquisition time. The compressive sensing (CS) based strategy may decrease the reconstruction time greatly, but it needs efficient reconstruction algorithms to produce high-quality and reliable images. This paper focuses on the algorithmic improvement for the sparse reconstruction of CS-MRI, especially considering a non-smooth convex minimization problem which is composed of the sum of a total variation regularization term and a -norm term of the wavelet transformation. The partly motivation of targeting the dual problem is that the dual variables are involved in relatively low-dimensional subspace. Instead of solving the primal model as usual, we turn our attention to its associated dual model composed of three variable blocks and two separable non-smooth function blocks. However, the directly extended alternating direction method of multipliers (ADMM) must be avoided because it may be divergent, although it usually performs well numerically. In order to solve the problem, we employ a symmetric Gauss-Seidel (sGS) technique based ADMM. Compared with the directly extended ADMM, this method only needs one additional iteration, but its convergence can be guaranteed theoretically. Besides, we also propose a generalized variant of ADMM because this method has been illustrated to be efficient for solving semidefinite programming in the past few years. Finally, we do extensive experiments on MRI reconstruction using some simulated and real MRI images under different sampling patterns and ratios. The numerical results demonstrate that the proposed algorithms significantly achieve high reconstruction accuracies with fast computational speed.
Recommendations
- Compressed sensing MRI reconstruction with multiple sparsity constraints on radial sampling
- A novel model and ADMM algorithm for MR image reconstruction
- Efficient blind compressed sensing using sparsifying transforms with convergence guarantees and application to magnetic resonance imaging
- Compressed sensing MR image reconstruction exploiting TGV and wavelet sparsity
- Solving constrained TV2L1-L2 MRI signal reconstruction via an efficient alternating direction method of multipliers
Cites work
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
- A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- An efficient algorithm for batch images alignment with adaptive rank-correction term
- An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- Compressed sensing
- Convergence analysis of tight framelet approach for missing data recovery
- Convex Analysis
- Discerning the linear convergence of ADMM for structured convex optimization through the lens of variational analysis
- Hankel matrix rank minimization with applications to system identification and realization
- Image restoration: a wavelet frame based model for piecewise smooth functions and beyond
- Monotone Operators and the Proximal Point Algorithm
- Nonlinear total variation based noise removal algorithms
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Symmetric Gauss-Seidel technique-based alternating direction methods of multipliers for transform invariant low-rank textures problem
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Total variation wavelet inpainting
- Two-step fixed-point proximity algorithms for multi-block separable convex problems
Cited in
(19)- Median filter based compressed sensing model with application to MR image reconstruction
- ADMM-EM method for \(L_1\)-norm regularized weighted least squares PET reconstruction
- Sparse parallel MRI based on accelerated operator splitting schemes
- A second-order TV-based coupling model and an ADMM algorithm for MR image reconstruction
- IDPCNN: iterative denoising and projecting CNN for MRI reconstruction
- Compressed sensing MRI reconstruction with multiple sparsity constraints on radial sampling
- A fast method for L1-L2 modeling for MR image compressive sensing
- Weighted two-level Bregman method with graph regularized sparse coding for MRI reconstruction
- Split Bregman algorithms for sparse group lasso with application to MRI reconstruction
- Efficient blind compressed sensing using sparsifying transforms with convergence guarantees and application to magnetic resonance imaging
- Nonconvex compressed sampling of natural images and applications to compressed MR imaging
- An ADMM algorithm for second-order TV-based MR image reconstruction
- Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing
- Fast reconstruction algorithm of magnetic resonance imaging based on wavelet tree sparsity structure
- An efficient Peaceman-Rachford splitting method for constrained TGV-shearlet-based MRI reconstruction
- Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization
- CS-MRI reconstruction based on the constrained TGV-shearlet scheme
- Denoising AMP for MRI reconstruction: BM3D-AMP-MRI
- scientific article; zbMATH DE number 7668285 (Why is no real title available?)
This page was built for publication: Efficient dual ADMMs for sparse compressive sensing MRI reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6040852)
