Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
From MaRDI portal
Publication:2252508
DOI10.1016/j.acha.2013.10.003zbMath1345.94016arXiv1301.3248OpenAlexW2962738640MaRDI QIDQ2252508
Publication date: 18 July 2014
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.3248
Gaussian noiseDantzig selectorsparse recoveryLASSOrestricted isometry propertysparse noise\(l_1\)-analysis
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for wavelets (65T60) General harmonic expansions, frames (42C15)
Related Items (17)
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 ⋮ THE RESTRICTED ISOMETRY PROPERTY FOR SIGNAL RECOVERY WITH COHERENT TIGHT FRAMES ⋮ \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed? ⋮ Improved RIP conditions for compressed sensing with coherent tight frames ⋮ Performance analysis for unconstrained analysis based approaches* ⋮ Iterative hard thresholding for compressed data separation ⋮ Analysis non-sparse recovery for relaxed ALASSO ⋮ Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising ⋮ Robust recovery of signals with partially known support information using weighted BPDN ⋮ Signal separation under coherent dictionaries and \(\ell_p\)-bounded noise ⋮ Signal recovery under mutual incoherence property and oracle inequalities ⋮ Robust sparse recovery via a novel convex model ⋮ Sparse recovery with general frame via general-dual-based analysis Dantzig selector ⋮ Stable recovery of analysis based approaches ⋮ Nonuniform recovery of fusion frame structured sparse signals
Uses Software
Cites Work
- Unnamed Item
- Perturbations of measurement matrices and dictionaries in compressed sensing
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- Compressed sensing with coherent and redundant dictionaries
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Democracy in action: quantization, saturation, and compressive sensing
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- Iterative hard thresholding for compressed sensing
- The restricted isometry property and its implications for compressed sensing
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- Real versus complex null space properties for sparse vector recovery
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- A simple proof of the restricted isometry property for random matrices
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles
- The cosparse analysis model and algorithms
- Simultaneous analysis of Lasso and Dantzig selector
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Atomic Decomposition by Basis Pursuit
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
- The Split Bregman Method for L1-Regularized Problems
- On sparse reconstruction from Fourier and Gaussian measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Signal Reconstruction From Noisy Random Projections
- Split Bregman Methods and Frame Based Image Restoration
- Compressed Sensing and Redundant Dictionaries
- Stability Results for Random Sampling of Sparse Trigonometric Polynomials
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Ten Lectures on Wavelets
- Shifting Inequality and Recovery of Sparse Signals
- Sparsity and Smoothness Via the Fused Lasso
- Sparse Approximate Solutions to Linear Systems
- Matching pursuits with time-frequency dictionaries
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis
- Recovery of Sparsely Corrupted Signals
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Analysis versus synthesis in signal priors
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
- Adaptive greedy approximations
This page was built for publication: Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
