Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization
From MaRDI portal
data driven tight framesfinite-rate-of-innovationmagnetic resonance imagingproximal alternating schemesstructured low rank matrix completiontight wavelet frames
Fourier series and coefficients in several variables (42B05) General harmonic expansions, frames (42C15) Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Numerical methods for variational inequalities and related problems (65K15) Numerical methods for inverse problems for integral equations (65R32) Computing methodologies for image processing (68U10) Applications of mathematical programming (90C90) Biomedical imaging and signal processing (92C55) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Abstract: Recently, the finite-rate-of-innovation (FRI) based continuous domain regularization is emerging as an alternative to the conventional on-the-grid sparse regularization for the compressed sensing (CS) due to its ability to alleviate the basis mismatch between the true support of the shape in the continuous domain and the discrete grid. In this paper, we propose a new off-the-grid regularization for the CS-MRI reconstruction. Following the recent works on two dimensional FRI, we assume that the discontinuities/edges of the image are localized in the zero level set of a band-limited periodic function. This assumption induces the linear dependencies among the Fourier samples of the gradient of the image, which leads to a low rank two-fold Hankel matrix. We further observe that the singular value decomposition of a low rank Hankel matrix corresponds to an adaptive tight frame system which can represent the image with sparse canonical coefficients. Based on this observation, we propose a data driven tight frame based off-the-grid regularization model for the CS-MRI reconstruction. To solve the nonconvex and nonsmooth model, a proximal alternating minimization algorithm with a guaranteed global convergence is adopted. Finally, the numerical experiments show that our proposed data driven tight frame based approach outperforms the existing approaches.
Recommendations
- Undersampled MR image reconstruction with data-driven tight frame
- Compressed sensing MRI reconstruction with multiple sparsity constraints on radial sampling
- Compressed sensing image restoration based on data-driven multi-scale tight frame
- Compressed sensing MR image reconstruction exploiting TGV and wavelet sparsity
- Efficient dual ADMMs for sparse compressive sensing MRI reconstruction
- Compressed sensing MR image reconstruction based on nonlocal total variation and partially known support
Cites work
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A combined first and second order variational approach for image reconstruction
- A fast SVD for multilevel block Hankel matrices with minimal memory storage
- A framelet-based image inpainting algorithm
- A second-order model for image denoising
- Adaptive multiresolution analysis structures and shearlet systems
- Affine systems in \(L_ 2(\mathbb{R}^d)\): The analysis of the analysis operator
- Atomic Norm Denoising With Applications to Line Spectral Estimation
- Compressed sensing
- Compressive Sampling Using Annihilating Filter-Based Low-Rank Interpolation
- Convergence analysis for iterative data-driven tight frame construction scheme
- Convex Recovery of Continuous Domain Piecewise Constant Images From Nonuniform Fourier Samples
- CT image reconstruction by spatial-Radon domain data-driven tight frame regularization
- Data-driven tight frame construction and image denoising
- Data-driven tight frame for multi-channel images and its application to joint color-depth image reconstruction
- Efficient blind compressed sensing using sparsifying transforms with convergence guarantees and application to magnetic resonance imaging
- Exact matrix completion via convex optimization
- Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion
- FRIST-flipping and rotation invariant sparsifying transform learning and applications
- Hankel Matrix Nuclear Norm Regularized Tensor Completion for N-dimensional Exponential Signals
- Hankel matrix rank minimization with applications to system identification and realization
- scientific article; zbMATH DE number 1324223 (Why is no real title available?)
- scientific article; zbMATH DE number 841126 (Why is no real title available?)
- scientific article; zbMATH DE number 6276219 (Why is no real title available?)
- Image restoration: total variation, wavelet frames, and beyond
- Learning Sparsifying Transforms
- Low-rank matrix recovery via iteratively reweighted least squares minimization
- MRA-based wavelet frames and applications
- Off-the-grid recovery of piecewise constant images from few Fourier samples
- On gradients of functions definable in o-minimal structures
- PET-MRI joint reconstruction by joint sparsity based tight frame regularization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Robust recovery of complex exponential signals from random Gaussian projections via low rank Hankel matrix reconstruction
- Robust Spectral Compressed Sensing via Structured Matrix Completion
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sampling Curves With Finite Rate of Innovation
- Sampling signals with finite rate of innovation
- Sensitivity to Basis Mismatch in Compressed Sensing
- Spectral Compressed Sensing via Projected Gradient Descent
- Split Bregman methods and frame based image restoration
- Super-resolution from noisy data
- The Split Bregman Method for L1-Regularized Problems
- Total generalized variation
- Towards a Mathematical Theory of Super‐resolution
- Wavelet Algorithms for High-Resolution Image Reconstruction
- Wavelet frames and image restorations
Cited in
(7)- Data-driven tight frame learning scheme based on local and non-local sparsity with application to image recovery
- Image restoration: structured low rank matrix framework for piecewise smooth functions and beyond
- Undersampled MR image reconstruction with data-driven tight frame
- Exploring structural sparsity of coil images from 3-dimensional directional tight framelets for SENSE reconstruction
- Restoration guarantee of image inpainting via low rank patch matrix completion
- Piecewise data-driven tight frame and _0-balanced image denoising method
- Medical image reconstruction with multi-level deep learning denoiser and tight frame regularization
This page was built for publication: Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5143293)
