Sparse signal recovery via generalized Gaussian function

DOI10.1007/S10898-022-01126-2MaRDI QIDQ2154451zbMATHOpenAlexFDO

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

zbMATH Keywords

sparse signal recovery\( \ell_0\) minimizationgeneralized Gaussian functionregularization minimizationthe DCS algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Inverse problems for functional-differential equations (34K29) Numerical methods of relaxation type (49M20)

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

Cites work

• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A proximal difference-of-convex algorithm with extrapolation
• Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
• Analysis of multiresolution image denoising schemes using generalized Gaussian and complexity priors
• Bayesian Compressive Sensing
• Bayesian Compressive Sensing Using Laplace Priors
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Compressed sensing
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC programming: overview.
• De-noising by soft-thresholding
• Decoding by Linear Programming
• Estimées localement fortement homogènes
• Greedy algorithm and \(m\)-term trigonometric approximation
• Iterative thresholding for sparse approximations
• Learning sparse classifiers with difference of convex functions algorithms
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Sparse Approximate Solutions to Linear Systems
• Sparse and redundant representations. From theory to applications in signal and image processing.
• Sparse nonnegative solution of underdetermined linear equations by linear programming
• Stable signal recovery from incomplete and inaccurate measurements
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• The Split Bregman Method for L1-Regularized Problems

Cited in

(6)

• Sparse recovery based on the generalized error function
• From Bernoulli–Gaussian Deconvolution to Sparse Signal Restoration
• Sparse signal recovery via exponential metric approximation
• Iterative gradient denoising algorithm for signal recovery using analysis-based implicit prior
• Sparse recovery with general frame via general-dual-based analysis Dantzig selector
• Sparse signal recovery based on majorization-minimization with enhanced sparsity

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)