Compressed sensing recovery via nonconvex shrinkage penalties
From MaRDI portal
Publication:3188784
Abstract: The minimization of compressed sensing is often relaxed to , which yields easy computation using the shrinkage mapping known as soft thresholding, and can be shown to recover the original solution under certain hypotheses. Recent work has derived a general class of shrinkages and associated nonconvex penalties that better approximate the original penalty and empirically can recover the original solution from fewer measurements. We specifically examine p-shrinkage and firm thresholding. In this work, we prove that given data and a measurement matrix from a broad class of matrices, one can choose parameters for these classes of shrinkages to guarantee exact recovery of the sparsest solution. We further prove convergence of the algorithm iterative p-shrinkage (IPS) for solving one such relaxed problem.
Recommendations
- Restricted isometry properties and nonconvex compressive sensing
- Sparse recovery by non-convex optimization - instance optimality
- A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
- Sparse signal recovery via non-convex optimization and overcomplete dictionaries
- An unbiased approach to compressed sensing
Cited in
(41)- Sparse signals recovered by non-convex penalty in quasi-linear systems
- Computational approaches to non-convex, sparsity-inducing multi-penalty regularization
- Bias versus non-convexity in compressed sensing
- Image restoration via the adaptive \(TV^p\) regularization
- Compressive Sensing on Manifolds Using a Nonparametric Mixture of Factor Analyzers: Algorithm and Performance Bounds
- Local recovery bounds for prior support constrained compressed sensing
- Robust nonconvex sparse optimization for impact force identification
- A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery
- Sparsest representations and approximations of an underdetermined linear system
- Non-uniform recovery guarantees for binary measurements and infinite-dimensional compressed sensing
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- Fast L1-L2 minimization via a proximal operator
- Minimization of transformed L₁ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- One-bit compressed sensing via \(\ell_p\) \((0<p<1)\)-minimization method
- Non-convex and convex coupling image segmentation via TGpV regularization and thresholding
- Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine
- An efficient nonconvex regularization for wavelet frame and total variation based image restoration
- Sparse recovery based on the generalized error function
- scientific article; zbMATH DE number 6311302 (Why is no real title available?)
- Recent trends and advances in solving the inverse problem for EEG source localization
- Doubly iteratively reweighted algorithm for constrained compressed sensing models
- A first-order smoothed penalty method for compressed sensing
- Limited-angle CT reconstruction with generalized shrinkage operators as regularizers
- Sparse signal recovery based on majorization-minimization with enhanced sparsity
- Compressive Sensing Reconstruction With Prior Information by Iteratively Reweighted Least-Squares
- Two-stage image segmentation based on nonconvex \(\ell_2-\ell_p\) approximation and thresholding
- Perfect reconstruction of sparse signals with piecewise continuous nonconvex penalties and nonconvexity control
- The springback penalty for robust signal recovery
- Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery
- A nonconvex nonsmooth image prior based on the hyperbolic tangent function
- Linearized Bregman iterations for compressed sensing
- Sparse parameter identification for stochastic systems based on \(L_\gamma\) regularization
- A non-convex regularization approach for compressive sensing
- Restricted isometry properties and nonconvex compressive sensing
- Minimization of \(L_1\) over \(L_2\) for sparse signal recovery with convergence guarantee
- Parametrized quasi-soft thresholding operator for compressed sensing and matrix completion
- Sampling from non-smooth distributions through Langevin diffusion
- Multiplicative noise removal via using nonconvex regularizers based on total variation and wavelet frame
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- Guarantees of fast band restricted thresholding algorithm for low-rank matrix recovery problem
- A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
This page was built for publication: Compressed sensing recovery via nonconvex shrinkage penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188784)
