Compressed data separation via _q-split analysis with _-constraint

DOI10.1007/S10114-024-2083-8MaRDI QIDQ6596308zbMATH OpenFDO

Authors Song Li, Junhong Lin

Publication date 2 September 2024

Published in Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10114-024-2083-8

zbMATH Keywords

\(\ell_q\)-split analysis Dantzig selectorcompressed sensingdata separationframesrestricted isometry property

Mathematics Subject Classification ID

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

Recommendations

• Compressed data separation via unconstrained l1-split analysis
• Compressed data separation under _p bounded noise
• Signal separation under coherent dictionaries and _p-bounded noise
• Compressed data separation via dual frames based split-analysis with Weibull matrices
• Iterative hard thresholding for compressed data separation

Cites work

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

Cited in

(1)

• Compressed data separation under _p bounded noise

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)