Compressed data separation via unconstrained l1-split analysis
From MaRDI portal
Recommendations
- Compressed data separation via dual frames based split-analysis with Weibull matrices
- Iterative hard thresholding for compressed data separation
- Compressed sensing construction for underdetermined source separation
- Compressive independent component analysis: theory and algorithms
- Compressed Sensing and Source Separation
- Compressed Data Separation With Redundant Dictionaries
- A proximal splitting method for separable convex programming and its application to compressive sensing
- Operator splitting methods in compressive sensing and sparse approximation
- Compressive-Projection Principal Component Analysis
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 simple proof of the restricted isometry property for random matrices
- Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise
- 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\)
- Decoding by Linear Programming
- Deep distributed convolutional neural networks: universality
- Hybrid-Spline Dictionaries for Continuous-Domain Inverse Problems
- Inpainting via sparse recovery with directional constraints
- Iterative hard thresholding for compressed data separation
- Learning theory of minimum error entropy under weak moment conditions
- Microlocal analysis of the geometric separation problem
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Nonuniform recovery of fusion frame structured sparse signals
- On sparse reconstruction from Fourier and Gaussian measurements
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Recovery of Sparsely Corrupted Signals
- Restricted q-Isometry Properties Adapted to Frames for Nonconvex l_q-Analysis
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal separation under coherent dictionaries and _p-bounded noise
- Simultaneous analysis of Lasso and Dantzig selector
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
- 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
- Split Bregman methods and frame based image restoration
- Stable recovery of analysis based approaches
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stable Recovery of Sparse Signals and an Oracle Inequality
- Stable recovery of sparse signals with coherent tight frames via l_p-analysis approach
- Stable restoration and separation of approximately sparse signals
- 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
- Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles
Cited in
(15)- 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 _p-bounded noise
- Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging
- On choosing initial values of iteratively reweighted \(\ell_1\) algorithms for the piece-wise exponential penalty
- Compressed data separation via \(\ell_q\)-split analysis with \(\ell_\infty\)-constraint
- Iteratively reweighted least squares for block sparse signal recovery with unconstrained \(l_{2,p}\) minimization
- Compressed data separation under _p bounded noise
- An optimized conjugate gradient method for unconstrained optimization and its application in sparse signal recovery
- New conditions on robust and stable recovery of non-strictly k-ranked matrices via Schatten p-norm minimization
- Generalized viscosity type inertial algorithm with applications to minimization problems
- -Rescaled Pure Super Greedy Algorithm with respect to Riesz dictionary
- Compressed data separation via _1 - _q-split analysis
- Operator sequence-based phase retrieval on quaternionic left Hilbert spaces
- Nonconvex deterministic matrix completion by projected gradient descent methods
This page was built for publication: Compressed data separation via unconstrained l1-split analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889890)
