Performance analysis for unconstrained analysis based approaches
From MaRDI portal
Publication:5097569
Recommendations
- Stable recovery of analysis based approaches
- Analysis _1-recovery with frames and Gaussian measurements
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- The restricted isometry property for signal recovery with coherent tight frames
- Sparse recovery with general frame via general-dual-based analysis Dantzig selector
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Proof of Conjecture on Restricted Isometry Property Constants $\delta _{tk}\ \left(0<t<\frac {4}{3}\right)$
- A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit
- A simple proof of the restricted isometry property for random matrices
- Analysis versus synthesis in signal priors
- Binary sparse signal recovery with binary matching pursuit
- Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis
- Compressed Sensing and Redundant Dictionaries
- Compressed sensing
- Compressed sensing with coherent and redundant dictionaries
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- Decoding by Linear Programming
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Fast Discrete Curvelet Transforms
- Fast Image Recovery Using Variable Splitting and Constrained Optimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Nearly Optimal Bounds for Orthogonal Least Squares
- New Bounds for Restricted Isometry Constants With Coherent Tight Frames
- New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
- On support sizes of restricted isometry constants
- On the Noise Robustness of Simultaneous Orthogonal Matching Pursuit
- On the _1-norm invariant convex k-sparse decomposition of signals
- One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations
- Optimal D-RIP bounds in compressed sensing
- Recovery of Sparsely Corrupted Signals
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
- Smoothing and Decomposition for Analysis Sparse Recovery
- Sparse Activity Detection for Massive Connectivity
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries
- Stable recovery of analysis based approaches
- Stable recovery of signals with the high order D-RIP condition
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- Stable signal recovery from incomplete and inaccurate measurements
- Structure-Aware Bayesian Compressive Sensing for Frequency-Hopping Spectrum Estimation With Missing Observations
- Ten Lectures on Wavelets
- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
- \(\ell_1-\alpha\ell_2\) minimization methods for signal and image reconstruction with impulsive noise removal
This page was built for publication: Performance analysis for unconstrained analysis based approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097569)
