A modified greedy analysis pursuit algorithm for the cosparse analysis model
From MaRDI portal
Publication:513670
DOI10.1007/s11075-016-0174-zzbMath1402.94030OpenAlexW2476121399MaRDI QIDQ513670
Zisheng Liu, Ping-Fan Dai, Ji-Cheng Li, Wenbo Li
Publication date: 7 March 2017
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-016-0174-z
inverse problemnon-convex optimizationsparse representationcosparse analysis modelgreedy analysis pursuit algorithm
Estimation in multivariate analysis (62H12) Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Compressed sensing with coherent and redundant dictionaries
- A general branch-and-bound algorithm for fair division problems
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Multi-frame compression: theory and design.
- The cosparse analysis model and algorithms
- Local behavior of sparse analysis regularization: applications to risk estimation
- Greedy-like algorithms for the cosparse analysis model
- 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)
- A Generalized Forward-Backward Splitting
- Performance Guarantees of the Thresholding Algorithm for the Cosparse Analysis Model
- Restricted isometry properties and nonconvex compressive sensing
- Sparse representations in unions of bases
- Greed is Good: Algorithmic Results for Sparse Approximation
- Just relax: convex programming methods for identifying sparse signals in noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Split Bregman Methods and Frame Based Image Restoration
- Sparse and Redundant Representations
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Atomic Decomposition by Basis Pursuit
- A Theory for Sampling Signals From a Union of Subspaces
- Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- 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
- L 1/2 regularization
- Analysis versus synthesis in signal priors
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Sparse Image and Signal Processing
