The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Exact Reconstruction of Sparse Signals via Nonconvex Minimization
Chartrand, R. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2007.898300 · Cited by 1,277
Cited by
Sparse Regularization via Convex Analysis
Selesnick, I. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2711501 · Cited by 429
Self-citation
Metadata
- Authors
- Chen, P.-Y., & Selesnick, I. W.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2014-07
- Volume
- 62
- Issue
- 13
- Pages
- 3464-3478
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2122688057
- Cited by
- 232
- References
- 2
- FWCI
- 13.94
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization. https://app.cochat.ai/papers/10.1109/tsp.2014.2329274
- The paper
- Chen, P.-Y., & Selesnick, I. W. (2014). Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2014.2329274
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.