Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization
From MaRDI portal
Publication:4579300
Abstract: Convex optimization with sparsity-promoting convex regularization is a standard approach for estimating sparse signals in noise. In order to promote sparsity more strongly than convex regularization, it is also standard practice to employ non-convex optimization. In this paper, we take a third approach. We utilize a non-convex regularization term chosen such that the total cost function (consisting of data consistency and regularization terms) is convex. Therefore, sparsity is more strongly promoted than in the standard convex formulation, but without sacrificing the attractive aspects of convex optimization (unique minimum, robust algorithms, etc.). We use this idea to improve the recently developed 'overlapping group shrinkage' (OGS) algorithm for the denoising of group-sparse signals. The algorithm is applied to the problem of speech enhancement with favorable results in terms of both SNR and perceptual quality.
Recommendations
- Sparse optimization for nonconvex group penalized estimation
- Group sparse recovery in impulsive noise via alternating direction method of multipliers
- The Group Lasso for Stable Recovery of Block-Sparse Signal Representations
- Nonconvex nonsmooth low-rank minimization for generalized image compressed sensing via group sparse representation
- Group Sparse Recovery via the \ell ^0(\ell ^2) Penalty: Theory and Algorithm
- An efficient denoising framework using weighted overlapping group sparsity
- Non-convex total variation regularization for convex denoising of signals
- Double \({l_1}\)-norm optimization image denoising algorithm via group sparse representation
- Group sparse optimization via \(\ell_{p,q}\) regularization
- Sparse Signal Approximation via Nonseparable Regularization
Cited in
(32)- Half-quadratic image restoration with a non-parallelism constraint
- Image denoising using combined higher order non-convex total variation with overlapping group sparsity
- Convex non-convex segmentation of scalar fields over arbitrary triangulated surfaces
- On the discontinuity of images recovered by noncovex nonsmooth regularized isotropic models with box constraints
- The \(\ell_{2,p}\) regularized total variation with overlapping group sparsity prior for image restoration with impulse noise
- An efficient denoising framework using weighted overlapping group sparsity
- A perturbation analysis based on group sparse representation with orthogonal matching pursuit
- Two-stage image segmentation based on nonconvex \(\ell_2-\ell_p\) approximation and thresholding
- Convex non-convex image segmentation
- Salt and pepper noise removal with multi-class dictionary learning and L\(_0\) norm regularizations
- Multichannel impedance inversion in the frequency domain via anisotropic total variation with overlapping group sparsity regularization
- Convex image denoising via non-convex regularization
- Convex image denoising via non-convex regularization with parameter selection
- Stochastic Deconvolution Over Groups
- The Group Lasso for Stable Recovery of Block-Sparse Signal Representations
- On the Edge Recovery Property of Noncovex Nonsmooth Regularization in Image Restoration
- Proximal gradient method with automatic selection of the parameter by automatic differentiation
- Non-convex and convex coupling image segmentation via TGpV regularization and thresholding
- A convex-nonconvex variational method for the additive decomposition of functions on surfaces
- Sparse optimization for nonconvex group penalized estimation
- Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
- scientific article; zbMATH DE number 7071841 (Why is no real title available?)
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Sparse Bayesian learning with automatic-weighting Laplace priors for sparse signal recovery
- Plug-and-play algorithms for convex non-convex regularization: convergence analysis and applications
- Online continuous time system identification in the presence of impulsive terms
- Robust nonconvex sparse optimization for impact force identification
- Generalized nonconvex nonsmooth four-directional total variation with overlapping group sparsity for image restoration
- Convex non-convex variational models
- Convex predictor-nonconvex corrector optimization strategy with application to signal decomposition
- A hybrid and inexact algorithm for nonconvex and nonsmooth optimization
- Improved low-rank matrix approximation in multivariate case
This page was built for publication: Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579300)
