The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Weighted Schatten $p$ -Norm Minimization for Image Denoising and Background Subtraction
Open accessAbstract
Low rank matrix approximation (LRMA), which aims to recover the underlying low rank matrix from its degraded observation, has a wide range of applications in computer vision. The latest LRMA methods resort to using the nuclear norm minimization (NNM) as a convex relaxation of the nonconvex rank minimization. However, NNM tends to over-shrink the rank components and treats the different rank components equally, limiting its flexibility in practical applications. We propose a more flexible model, namely, the weighted Schatten p-norm minimization (WSNM), to generalize the NNM to the Schatten p-norm minimization with weights assigned to different singular values. The proposed WSNM not only gives better approximation to the original low-rank assumption, but also considers the importance of different rank components. We analyze the solution of WSNM and prove that, under certain weights permutation, WSNM can be equivalently transformed into independent non-convex lp-norm subproblems, whose global optimum can be efficiently solved by generalized iterated shrinkage algorithm. We apply WSNM to typical low-level vision problems, e.g., image denoising and background subtraction. Extensive experimental results show, both qualitatively and quantitatively, that the proposed WSNM can more effectively remove noise, and model the complex and dynamic scenes compared with state-of-the-art methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Image denoising by sparse 3-D transform-domain collaborative filtering
Dabov, K., Foi, A., Katkovnik, V., & Egiazarian, K. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.901238 · Cited by 9,283
Robust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
Weighted Nuclear Norm Minimization with Application to Image Denoising
Gu, S., Zhang, L., Zuo, W., & Feng, X. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.366 · Cited by 2,316
Self-citationNon-local sparse models for image restoration
Mairal, J., Bach, F., Ponce, J., Sapiro, G., & Zisserman, A. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459452 · Cited by 1,666
From learning models of natural image patches to whole image restoration
Zoran, D., & Weiss, Y. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126278 · Cited by 1,522
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
The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices
Lin, Z., Chen, M., & Ma, Y. (2010) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · doi:10.48550/arxiv.1009.5055 · Cited by 1,176
Statistical Modeling of Complex Backgrounds for Foreground Object Detection
Li, L., Huang, W., Gu, I. Y.-H., & Tian, Q. (2004) · IEEE Transactions on Image Processing · doi:10.1109/tip.2004.836169 · Cited by 991
Nonlocal Image Restoration With Bilateral Variance Estimation: A Low-Rank Approach
Dong, W., Shi, G., & Li, X. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2221729 · Cited by 655
A Framework for Robust Subspace Learning
De la Torre, F., & Black, M. J. (2003) · International Journal of Computer Vision · doi:10.1023/a:1023709501986 · Cited by 604
A Generalized Iterated Shrinkage Algorithm for Non-convex Sparse Coding
Zuo, W., Meng, D., Zhang, L., Feng, X., & Zhang, D. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.34 · Cited by 396
Self-citationA trace inequality of John von Neumann
Mirsky, L. (1975) · Monatshefte für Mathematik · doi:10.1007/bf01647331 · Cited by 343
A Comprehensive Survey to Face Hallucination
Wang, N., Tao, D., Gao, X., Li, X., & Li, J. (2014) · International Journal of Computer Vision · doi:10.1007/s11263-013-0645-9 · Cited by 339
Damped Newton Algorithms for Matrix Factorization with Missing Data
Buchanan, A. M., & Fitzgibbon, A. W. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.118 · Cited by 299
Patch-Based Near-Optimal Image Denoising
Chatterjee, P., & Milanfar, P. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2172799 · Cited by 296
Generalized Nonconvex Nonsmooth Low-Rank Minimization
Lu, C., Tang, J., Yan, S., & Lin, Z. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.526 · Cited by 271
Unifying Nuclear Norm and Bilinear Factorization Approaches for Low-Rank Matrix Decomposition
Cabral, R., De la Torre, F., Costeira, J. P., & Bernardino, A. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.309 · Cited by 204
Talebi, H., & Milanfar, P. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2013.2293425 · Cited by 200
Nikolova, M. (2005) · Multiscale Modeling & Simulation · doi:10.1137/040619582 · Cited by 178
Eriksson, A. P., & Hengel, A. V. D. (2010) · Cited by 97
Accelerated low-rank visual recovery by random projection
Mu, Y., Dong, J., Yuan, X., & Yan, S. (2011) · doi:10.1109/cvpr.2011.5995369 · Cited by 87
On the Performance of Manhattan Nonnegative Matrix Factorization
Liu, T., & Tao, D. (2015) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2015.2458986 · Cited by 86
Non-Local Auto-Encoder With Collaborative Stabilization for Image Restoration
Wang, R., & Tao, D. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2016.2541318 · Cited by 78
Large-Cone Nonnegative Matrix Factorization
Liu, T., Gong, M., & Tao, D. (2016) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2574748 · Cited by 73
Coupled Learning for Facial Deblur
Tian, D., & Tao, D. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2509418 · Cited by 25
Cited by
Dai, Y., & Wu, Y. (2017) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2017.2700023 · Cited by 615
Rank Minimization for Snapshot Compressive Imaging
Liu, Y., Yuan, X., Suo, J., Brady, D. J., & Dai, Q. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2873587 · Cited by 466
Self-citationSun, Y., Yang, J., & An, W. (2021) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2020.3022069 · Cited by 332
A comprehensive survey on regularization strategies in machine learning
Tian, Y., & Zhang, Y. (2022) · Information Fusion · doi:10.1016/j.inffus.2021.11.005 · Cited by 298
Metadata
- Authors
- Xie, Y., Gu, S., Liu, Y., Zuo, W., Zhang, W., & Zhang, L.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2016-10
- Volume
- 25
- Issue
- 10
- Pages
- 4842-4857
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2187214659
- Cited by
- 412
- References
- 28
- FWCI
- 22.13
- 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
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.