The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Tensor Robust Principal Component Analysis with a New Tensor Nuclear Norm
Open accessAbstract
In this paper, we consider the Tensor Robust Principal Component Analysis (TRPCA) problem, which aims to exactly recover the low-rank and sparse components from their sum. Our model is based on the recently proposed tensor-tensor product (or t-product) [14]. Induced by the t-product, we first rigorously deduce the tensor spectral norm, tensor nuclear norm, and tensor average rank, and show that the tensor nuclear norm is the convex envelope of the tensor average rank within the unit ball of the tensor spectral norm. These definitions, their relationships and properties are consistent with matrix cases. Equipped with the new tensor nuclear norm, we then solve the TRPCA problem by solving a convex program and provide the theoretical guarantee for the exact recovery. Our TRPCA model and recovery guarantee include matrix RPCA as a special case. Numerical experiments verify our results, and the applications to image recovery and background modeling problems demonstrate the effectiveness of our method.
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
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
Martin, D., Fowlkes, C., Tal, D., & Malik, J. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937655 · Cited by 8,216
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
Robust Recovery of Subspace Structures by Low-Rank Representation
Liu, G., Lin, Z., Yan, S., Sun, J., Yu, Y., & Ma, Y. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.88 · Cited by 3,594
Self-citationTensor Completion for Estimating Missing Values in Visual Data
Liu, J., Musialski, P., Wonka, P., & Ye, J. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.39 · Cited by 2,063
Factorization strategies for third-order tensors
Kilmer, M. E., & Martin, C. D. (2011) · Linear Algebra and its Applications · doi:10.1016/j.laa.2010.09.020 · Cited by 1,349
Most Tensor Problems Are NP-Hard
Hillar, C. J., & Lim, L.-H. (2013) · Journal of the ACM · doi:10.1145/2512329 · Cited by 1,099
Novel Methods for Multilinear Data Completion and De-noising Based on Tensor-SVD
Zhang, Z., Ely, G., Aeron, S., Hao, N., & Kilmer, M. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.485 · Cited by 798
Exact Tensor Completion Using t-SVD
Zhang, Z., & Aeron, S. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2639466 · Cited by 675
Lu, C., Feng, J., Chen, Y., Liu, W., Lin, Z., & Yan, S. (2016) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2016.567 · Cited by 578
Self-citationTensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
Semerci, O., Hao, N., Kilmer, M. E., & Miller, E. L. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2305840 · Cited by 389
Characterization of the subdifferential of some matrix norms
Watson, G. A. (1992) · Linear Algebra and its Applications · doi:10.1016/0024-3795(92)90407-2 · Cited by 364
Tensor–tensor products with invertible linear transforms
Kernfeld, E. M., Kilmer, M. E., & Aeron, S. (2015) · Linear Algebra and its Applications · doi:10.1016/j.laa.2015.07.021 · Cited by 344
An Order-$p$ Tensor Factorization with Applications in Imaging
Martin, C. D., Shafer, R., & LaRue, B. (2013) · SIAM Journal on Scientific Computing · doi:10.1137/110841229 · Cited by 296
Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery
Mu, C., Huang, B., Wright, J. N., & Goldfarb, D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1307.5870 · Cited by 203
Generalized Singular Value Thresholding
Lu, C., Zhu, C., Xu, C., Yan, S., & Lin, Z. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9464 · Cited by 196
Self-citationA Unified Alternating Direction Method of Multipliers by Majorization Minimization
Lu, C., Feng, J., Yan, S., & Lin, Z. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2689021 · Cited by 187
Self-citationIncoherence-Optimal Matrix Completion
Chen, Y. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2415195 · Cited by 171
Self-citationTensor SVD: Statistical and Computational Limits
Zhang, A., & Xia, D. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2841377 · Cited by 168
A New Convex Relaxation for Tensor CompletionPreprint
Romera‐Paredes, B., & Pontil, M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1307.4653 · Cited by 165
Estimation of low-rank tensors via convex optimizationPreprint
Tomioka, R., Hayashi, K., & Kashima, H. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1010.0789 · Cited by 134
Tensor vs Matrix Methods: Robust Tensor Decomposition under Block Sparse PerturbationsPreprint
Anandkumar, A., Jain, P., Shi, Y., & Niranjan, U. N. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.04747 · Cited by 65
Cited by
Bouwmans, T., Javed, S., Sultana, M., & Jung, S. K. (2019) · Neural Networks · doi:10.1016/j.neunet.2019.04.024 · Cited by 396
Sun, Y., Yang, J., & An, W. (2021) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2020.3022069 · Cited by 332
Combustion machine learning: Principles, progress and prospects
Ihme, M., Chung, W. T., & Mishra, A. A. (2022) · Progress in Energy and Combustion Science · doi:10.1016/j.pecs.2022.101010 · Cited by 265
Liang, C., Wang, L., Liu, L., Zhang, H., & Guo, F. (2023) · Pattern Recognition · doi:10.1016/j.patcog.2023.109632 · Cited by 72
Yang, J., Fu, C., & Lu, H. (2021) · Information Sciences · doi:10.1016/j.ins.2021.02.028 · Cited by 14
Metadata
- Authors
- Lu, C., Feng, J., Chen, Y., Liu, W., Lin, Z., & Yan, S.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2020-04-01
- Volume
- 42
- Issue
- 4
- Pages
- 925-938
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- 1939-3539
- OpenAlex
- W2963885538
- Cited by
- 1,144
- References
- 23
- FWCI
- 39.37
- 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.