Group sparse recovery in impulsive noise via alternating direction method of multipliers
DOI10.1016/j.acha.2019.04.002zbMath1458.94139OpenAlexW2936395840MaRDI QIDQ2197950
Wendong Wang, Feng Zhang, Jian-Jun Wang, Jian-Wen Huang
Publication date: 1 September 2020
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2019.04.002
impulsive noisealternative direction method of multiplierssparse recoverycompressed sensingLagrangian methodsgroup sparse
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) General harmonic expansions, frames (42C15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information theory (general) (94A15)
Related Items (1)
Uses Software
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Block sparse recovery via mixed \(l_2/l_1\) minimization
- Rates of convergence of extreme for general error distribution under power normalization
- Asymptotic expansions of the moments of extremes from general error distribution
- Tree-guided group lasso for multi-response regression with structured sparsity, with an application to eQTL mapping
- The restricted isometry property and its implications for compressed sensing
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Fast implementation of orthogonal greedy algorithm for tight wavelet frames
- The class of subexponential distributions
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- Stable restoration and separation of approximately sparse signals
- A new bound on the block restricted isometry constant in compressed sensing
- Signal recovery from incomplete measurements in the presence of outliers
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
- Proximal Splitting Methods in Signal Processing
- Restricted $q$-Isometry Properties Adapted to Frames for Nonconvex $l_q$-Analysis
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Tail Behavior of the General Error Distribution
- Decoding by Linear Programming
- Bounds on a Probability for the Heavy Tailed Distribution and the Probability of Deficient Decoding in Sequential Decoding
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Highly Robust Error Correction byConvex Programming
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- On $l_q$ Optimization and Matrix Completion
- New Bounds for Restricted Isometry Constants With Coherent Tight Frames
- Robust Low-Rank Matrix Factorization Under General Mixture Noise Distributions
- Classification With the Sparse Group Lasso
- Robust Sparse Recovery in Impulsive Noise via $\ell _p$ -$\ell _1$ Optimization
- High-Dimensional Probability
- Convergence Rate of Extremes for the General Error Distribution
- Robust Recovery of Signals From a Structured Union of Subspaces
- Efficient Algorithms for Robust Recovery of Images From Compressed Data
This page was built for publication: Group sparse recovery in impulsive noise via alternating direction method of multipliers
