Stable recovery of analysis based approaches

DOI10.1016/j.acha.2014.08.001zbMath1345.94019OpenAlexW2078226159MaRDI QIDQ2347901

Yanyan Li

Publication date: 10 June 2015

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.acha.2014.08.001

zbMATH Keywords

tight framescompressed sensingrestricted isometry propertystable recovery\(l_1\) analysis based approaches

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (13)

Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence ⋮ Compressed data separation via unconstrained l1-split analysis ⋮ Signal recovery under cumulative coherence ⋮ \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed? ⋮ Performance analysis for unconstrained analysis based approaches* ⋮ Iterative hard thresholding for compressed data separation ⋮ Stability of the elastic net estimator ⋮ LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing ⋮ Robust recovery of signals with partially known support information using weighted BPDN ⋮ Signal recovery under mutual incoherence property and oracle inequalities ⋮ Low-rank matrix recovery via regularized nuclear norm minimization ⋮ An improved bound of cumulative coherence for signal recovery ⋮ RIP-based performance guarantee for low-tubal-rank tensor recovery

Cites Work

• Wavelet frame based blind image inpainting
• Compressed sensing with coherent and redundant dictionaries
• A remark on the Lasso and the Dantzig selector
• 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
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Decoding by Linear Programming
• Uncertainty principles and ideal atomic decomposition
• Sparse Approximation Property and Stable Recovery of Sparse Signals From Noisy Measurements
• New Bounds for Restricted Isometry Constants With Coherent Tight Frames
• Smoothing and Decomposition for Analysis Sparse Recovery
• De-noising by soft-thresholding
• Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• Analysis versus synthesis in signal priors
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices

This page was built for publication: Stable recovery of analysis based approaches