Sparse signal recovery via generalized Gaussian function
DOI10.1007/S10898-022-01126-2zbMATH Open1495.90138OpenAlexW4210809762MaRDI QIDQ2154451FDOQ2154451
Authors: Qian Zhang, S. Lin, Hai-Yang Li, Ji-Gen Peng 
Publication date: 19 July 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01126-2
Recommendations
- Sparse signal recovery based on majorization-minimization with enhanced sparsity
- scientific article; zbMATH DE number 6613775
- Sparse signal recovery via non-convex optimization and overcomplete dictionaries
- Sparse approximate reconstruction decomposed by two optimization problems
- Sparse signal recovery by accelerated \(\ell_q\) \((0<q<1)\) thresholding algorithm
sparse signal recovery\( \ell_0\) minimizationgeneralized Gaussian functionregularization minimizationthe DCS algorithm
Nonconvex programming, global optimization (90C26) Inverse problems for functional-differential equations (34K29) Numerical methods of relaxation type (49M20)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Title not available (Why is that?)
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming: overview.
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Decoding by Linear Programming
- Stable signal recovery from incomplete and inaccurate measurements
- The Split Bregman Method for L1-Regularized Problems
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Compressed sensing
- De-noising by soft-thresholding
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Sparse Approximate Solutions to Linear Systems
- Iterative thresholding for sparse approximations
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Bayesian Compressive Sensing Using Laplace Priors
- Greedy algorithm and \(m\)-term trigonometric approximation
- Analysis of multiresolution image denoising schemes using generalized Gaussian and complexity priors
- Learning sparse classifiers with difference of convex functions algorithms
- Bayesian Compressive Sensing
- A proximal difference-of-convex algorithm with extrapolation
- Estimées localement fortement homogènes
Cited In (6)
- From Bernoulli–Gaussian Deconvolution to Sparse Signal Restoration
- Sparse recovery based on the generalized error function
- Sparse signal recovery based on majorization-minimization with enhanced sparsity
- Iterative gradient denoising algorithm for signal recovery using analysis-based implicit prior
- Sparse signal recovery via exponential metric approximation
- Sparse recovery with general frame via general-dual-based analysis Dantzig selector
This page was built for publication: Sparse signal recovery via generalized Gaussian function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154451)
