The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition
Abstract
We develop new nonconvex approaches for matrix optimization problems involving sparsity. The heart of the methods is a new, nonconvex penalty function that is designed for efficient minimization by means of a generalized shrinkage operation. We apply this approach to the decomposition of video into low rank and sparse components, which is able to separate moving objects from the stationary background better than in the convex case. In the case of noisy data, we add a nonconvex regularization, and apply a splitting approach to decompose the optimization problem into simple, parallelizable components. The nonconvex regularization ameliorates contrast loss, thereby allowing stronger denoising without losing more signal to the residual.
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
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
Wang, Y., Yang, J., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/080724265 · Cited by 1,975 · cited 1×
“-SHRINKAGE”
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
Self-citation
Cited by
Global Convergence of ADMM in Nonconvex Nonsmooth Optimization
Wang, Y., Yin, W., & Zeng, J. (2019) · Journal of Scientific Computing · doi:10.1007/s10915-018-0757-z · Cited by 1,268
Weighted Nuclear Norm Minimization and Its Applications to Low Level Vision
Gu, S., Xie, Q., Meng, D., Zuo, W., Feng, X., & Zhang, L. (2017) · International Journal of Computer Vision · doi:10.1007/s11263-016-0930-5 · Cited by 816
Bouwmans, T., & Zahzah, E. H. (2014) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2013.11.009 · Cited by 463
A Generalized Low-Rank Appearance Model for Spatio-temporally Correlated Rain Streaks
Chen, Y.-L., & Hsu, C.-T. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.247 · Cited by 458
Bouwmans, T., Sobral, A., Javed, S., Jung, S. K., & Zahzah, E.-H. (2017) · Computer Science Review · doi:10.1016/j.cosrev.2016.11.001 · Cited by 267
Metadata
- Authors
- Chartrand, R.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2012-11
- Volume
- 60
- Issue
- 11
- Pages
- 5810-5819
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2031993275
- Cited by
- 189
- References
- 2
- FWCI
- 19.06
- Type
- journal article
- Language
- en
- Open access
- closed
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: Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition. https://app.cochat.ai/papers/10.1109/tsp.2012.2208955
- The paper
- Chartrand, R. (2012). Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2012.2208955
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.