Tight-frame-like analysis-sparse recovery using nontight sensing matrices
From MaRDI portal
back-projection losscompressed sensing image recoverydeep-unfolded networksrestricted isometry propertysparse signal recoverytight frames
Iterative numerical methods for linear systems (65F10) Ill-posedness and regularization problems in numerical linear algebra (65F22) Convex programming (90C25) Nonlinear programming (90C30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Recommendations
- A Lifted \ell₁ Framework for Sparse Recovery
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
- Compressive sensing with redundant dictionaries and structured measurements
Cites work
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A majorize-minimize subspace approach for _2-_0 image regularization
- A mathematical introduction to compressive sensing
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
- AMP-Inspired Deep Networks for Sparse Linear Inverse Problems
- An efficient augmented Lagrangian method with applications to total variation minimization
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Analysis versus synthesis in signal priors
- Atomic Decomposition by Basis Pursuit
- Bayesian Compressive Sensing
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Bregmanized nonlocal regularization for deconvolution and sparse reconstruction
- Compressed sensing
- Compressed Sensing and Redundant Dictionaries
- Compressed sensing with coherent and redundant dictionaries
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- Compressive Sensing via Nonlocal Low-Rank Regularization
- Construction of Incoherent Unit Norm Tight Frames With Application to Compressed Sensing
- Data-driven tight frame construction and image denoising
- Designing structured tight frames via an alternating projection method
- Efficient schemes for total variation minimization under constraints in image processing
- Equiangular lines
- Fienup Algorithm With Sparsity Constraints: Application to Frequency-Domain Optical-Coherence Tomography
- Generalized alternating projection for weighted-\(\ell_{2,1}\) minimization with applications to model-based compressive sensing
- Grassmannian frames with applications to coding and communication
- Greed is Good: Algorithmic Results for Sparse Approximation
- Hard thresholding pursuit: an algorithm for compressive sensing
- High-Resolution Radar via Compressed Sensing
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Image Restoration by Iterative Denoising and Backward Projections
- Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
- Matching pursuits with time-frequency dictionaries
- Matrix Analysis
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Model-Based Compressive Sensing
- Modulated Unit-Norm Tight Frames for Compressed Sensing
- Nearly unbiased variable selection under minimax concave penalty
- NESTA: A fast and accurate first-order method for sparse recovery
- Nonlinear total variation based noise removal algorithms
- On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
- On the convergence rate of projected gradient descent for a back-projection based objective
- Optimized Projections for Compressed Sensing
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Smoothing and Decomposition for Analysis Sparse Recovery
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse Regularization via Convex Analysis
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Spatial Compressive Sensing for MIMO Radar
- Stability of over-relaxations for the forward-backward algorithm, application to FISTA
- The art of frame theory
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The road to deterministic matrices with the restricted isometry property
- The Split Bregman Method for L1-Regularized Problems
- Theory and applications of compressed sensing
- Trainable ISTA for Sparse Signal Recovery
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Vector Approximate Message Passing
This page was built for publication: Tight-frame-like analysis-sparse recovery using nontight sensing matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587659)
