Tensor Robust Principal Component Analysis with A New Tensor Nuclear Norm
arXiv:1804.03728
Abstract
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). 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.
arXiv commentarXiv admin note: text overlap with arXiv:1708.04181
References in corpus (9)
- Robust Recovery of Subspace Structures by Low-Rank Representation
- Tensor-based formulation and nuclear norm regularization for multi-energy computed tomography
- Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery
- Incoherence-Optimal Matrix Completion
- Estimation of low-rank tensors via convex optimization
- Fixed-Rank Representation for Unsupervised Visual Learning
- Linearized Alternating Direction Method with Parallel Splitting and Adaptive Penalty for Separable Convex Programs in Machine Learning
- Tensor vs Matrix Methods: Robust Tensor Decomposition under Block Sparse Perturbations
- Noise-Tolerant Life-Long Matrix Completion via Adaptive Sampling