Compressed data separation via $\ell_q$-split analysis with $\ell_\infty$-constraint

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) General harmonic expansions, frames (42C15) Approximation with constraints (41A29) Sampling theory in information and communication theory (94A20)

Cites Work

Compressed sensing with coherent tight frames via $l_q$-minimization for $0 < q \leq 1$
Compressed sensing with coherent and redundant dictionaries
Simultaneous cartoon and texture inpainting
A simple proof of the restricted isometry property for random matrices
A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit
The cosparse analysis model and algorithms
Compressed data separation via dual frames based split-analysis with Weibull matrices
Iterative hard thresholding for compressed data separation
Signal separation under coherent dictionaries and $\ell_p$-bounded noise
Analysis of inpainting via clustered sparsity and microlocal analysis
Stable restoration and separation of approximately sparse signals
Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
Optimal RIP bounds for sparse signals recovery via $\ell_p$ minimization
Stable recovery of analysis based approaches
Optimal $D$-RIP bounds in compressed sensing
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).
Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
$\ell^1$-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
Atomic decomposition by basis pursuit
Analysis Recovery With Coherent Frames and Correlated Measurements
Restricted $q$-Isometry Properties Adapted to Frames for Nonconvex $l_q$-Analysis
New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
Restricted isometry properties and nonconvex compressive sensing
Image decomposition via the combination of sparse representations and a variational approach
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
Decoding by Linear Programming
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Uncertainty principles and ideal atomic decomposition
A Proof of Conjecture on Restricted Isometry Property Constants $\delta _{tk}\ \left(0<t<\frac {4}{3}\right)$
New Bounds for Restricted Isometry Constants With Coherent Tight Frames
Smoothing and Decomposition for Analysis Sparse Recovery
Microlocal Analysis of the Geometric Separation Problem
Analysis of simultaneous inpainting and geometric separation based on sparse decomposition
Nonuniform recovery of fusion frame structured sparse signals
Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis
Recovery of Sparsely Corrupted Signals
Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
Compressed Data Separation With Redundant Dictionaries
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
Stable signal recovery from incomplete and inaccurate measurements
Compressed sensing

This page was built for publication: Compressed data separation via $\ell_q$-split analysis with $\ell_\infty$-constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596308)

Compressed data separation via \(\ell_q\)-split analysis with \(\ell_\infty\)-constraint