Greedy-like algorithms for the cosparse analysis model
From MaRDI portal
Publication:2437331
DOI10.1016/j.laa.2013.03.004zbMath1332.94043arXiv1207.2456MaRDI QIDQ2437331
Publication date: 3 March 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.2456
synthesis; analysis; compressed sensing; iterative hard thresholding; sparse representations; CoSaMP; hard thresholding pursuit; subspace-pursuit
62H12: Estimation in multivariate analysis
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
94A20: Sampling theory in information and communication theory
Related Items
TWO NEW LOWER BOUNDS FOR THE SPARK OF A MATRIX, Robust analysis ℓ1-recovery from Gaussian measurements and total variation minimization, Multi-Layer Sparse Coding: The Holistic Way, Dictionary-sparse recovery via thresholding-based algorithms, Sampling rates for \(\ell^1\)-synthesis, A modified greedy analysis pursuit algorithm for the cosparse analysis model, Dimensionality reduction with subgaussian matrices: a unified theory, Sampling in the analysis transform domain, Analysis \(\ell_1\)-recovery with frames and Gaussian measurements, Analysis sparse representation for nonnegative signals based on determinant measure by DC programming, Structured overcomplete sparsifying transform learning with convergence guarantees and applications, Stochastic greedy algorithms for multiple measurement vectors, Generalizing CoSaMP to signals from a union of low dimensional linear subspaces, Near oracle performance and block analysis of signal space greedy methods, Greedy signal space methods for incoherence and beyond, Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames, \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?, Sparsity Based Methods for Overparameterized Variational Problems, Compressive Sensing with Redundant Dictionaries and Structured Measurements, Compressive Sensing in Acoustic Imaging, Cosparsity in Compressed Sensing
Uses Software
Cites Work
- Compressed sensing with coherent and redundant dictionaries
- 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
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- 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
- Matrix recipes for hard thresholding methods
- Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
- Robust Sparse Analysis Regularization
- Performance Guarantees of the Thresholding Algorithm for the Cosparse Analysis Model
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Non-asymptotic theory of random matrices: extreme singular values
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Sparse representations in unions of bases
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Compressed Sensing and Redundant Dictionaries
- Iteratively reweighted least squares minimization for sparse recovery
- A Theory for Sampling Signals From a Union of Subspaces
- RIP-Based Near-Oracle Performance Guarantees for SP, CoSaMP, and IHT
- Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model
- Sparsity and Smoothness Via the Fused Lasso
- Matching pursuits with time-frequency dictionaries
- Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Analysis versus synthesis in signal priors
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Adaptive greedy approximations
