Efficient blind compressed sensing using sparsifying transforms with convergence guarantees and application to magnetic resonance imaging
From MaRDI portal
Publication:3454501
Abstract: Natural signals and images are well-known to be approximately sparse in transform domains such as Wavelets and DCT. This property has been heavily exploited in various applications in image processing and medical imaging. Compressed sensing exploits the sparsity of images or image patches in a transform domain or synthesis dictionary to reconstruct images from undersampled measurements. In this work, we focus on blind compressed sensing, where the underlying sparsifying transform is a priori unknown, and propose a framework to simultaneously reconstruct the underlying image as well as the sparsifying transform from highly undersampled measurements. The proposed block coordinate descent type algorithms involve highly efficient optimal updates. Importantly, we prove that although the proposed blind compressed sensing formulations are highly nonconvex, our algorithms are globally convergent (i.e., they converge from any initialization) to the set of critical points of the objectives defining the formulations. These critical points are guaranteed to be at least partial global and partial local minimizers. The exact point(s) of convergence may depend on initialization. We illustrate the usefulness of the proposed framework for magnetic resonance image reconstruction from highly undersampled k-space measurements. As compared to previous methods involving the synthesis dictionary model, our approach is much faster, while also providing promising reconstruction quality.
Recommendations
- Iterative thresholding compressed sensing MRI based on contourlet transform
- Convolutional Sparse Coding in Gradient Domain for MRI Reconstruction
- Nonconvex compressed sampling of natural images and applications to compressed MR imaging
- Efficient dual ADMMs for sparse compressive sensing MRI reconstruction
- Curvelet-wavelet regularized split Bregman iteration for compressed sensing
Cites work
- scientific article; zbMATH DE number 3809879 (Why is no real title available?)
- scientific article; zbMATH DE number 1465030 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- $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 block coordinate variable metric forward-backward algorithm
- A self-referencing level-set method for image reconstruction from sparse Fourier samples
- Adaptive greedy approximations
- Analysis versus synthesis in signal priors
- Atomic Decomposition by Basis Pursuit
- Blind Compressed Sensing
- Compressed sensing
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Decoding by Linear Programming
- Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization
- Dictionary Learning for Sparse Approximations With the Majorization Method
- Efficient blind compressed sensing using sparsifying transforms with convergence guarantees and application to magnetic resonance imaging
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Learning Doubly Sparse Transforms for Images
- Learning Filter Bank Sparsifying Transforms
- Learning Multiscale Sparse Representations for Image and Video Restoration
- Learning Sparsifying Transforms
- Least angle regression. (With discussion)
- Matching pursuits with time-frequency dictionaries
- Online learning for matrix factorization and sparse coding
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Recursive Least Squares Dictionary Learning Algorithm
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Solving quadratically constrained least squares problems using a differential-geometric approach
- Sparse Approximate Solutions to Linear Systems
- Sparse and Redundant Modeling of Image Content Using an Image-Signature-Dictionary
- Sparsifying Transform Learning With Efficient Optimal Updates and Convergence Guarantees
- Stable recovery of sparse overcomplete representations in the presence of noise
- Structured overcomplete sparsifying transform learning with convergence guarantees and applications
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Variational Analysis
- Wavelet-Based Compressed Sensing Using a Gaussian Scale Mixture Model
Cited in
(8)- Iterative thresholding compressed sensing MRI based on contourlet transform
- FRIST-flipping and rotation invariant sparsifying transform learning and applications
- Semi-Blind Sparse Image Reconstruction With Application to MRFM
- Efficient blind compressed sensing using sparsifying transforms with convergence guarantees and application to magnetic resonance imaging
- Maximum likelihood estimation of regularization parameters in high-dimensional inverse problems: an empirical Bayesian approach. II: Theoretical analysis
- Efficient dual ADMMs for sparse compressive sensing MRI reconstruction
- A four directions variational method for solving image processing problems
- Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization
This page was built for publication: Efficient blind compressed sensing using sparsifying transforms with convergence guarantees and application to magnetic resonance imaging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454501)
