mlsanityData to 7 Oct 2026

Tensor N-tubal rank and its convex relaxation for low-rank tensor recovery

arXiv 1812.00688 ↗First posted 3 Dec 2018cs.CVcited by 19

Not on the map. Why?

Abstract (arXiv)

As low-rank modeling has achieved great success in tensor recovery, many research efforts devote to defining the tensor rank. Among them, the recent popular tensor tubal rank, defined based on the tensor singular value decomposition (t-SVD), obtains promising results. However, the framework of the t-SVD and the tensor tubal rank are applicable only to three-way tensors and lack of flexibility to handle different correlations along different modes. To tackle these two issues, we define a new tensor unfolding operator, named mode-k1k2 tensor unfolding, as the process of lexicographically stacking the mode-k1k2 slices of an N-way tensor into a three-way tensor, which is a three-way extension of the well-known mode-k tensor matricization. Based on it, we define a novel tensor rank, the tensor N-tubal rank, as a vector whose elements contain the tubal rank of all mode-k1k2 unfolding tensors, to depict the correlations along different modes. To efficiently minimize the proposed N-tubal rank, we establish its convex relaxation: the weighted sum of tensor nuclear norm (WSTNN). Then, we apply WSTNN to low-rank tensor completion (LRTC) and tensor robust principal component analysis (TRPCA). The corresponding WSTNN-based LRTC and TRPCA models are proposed, and two efficient alternating direction method of multipliers (ADMM)-based algorithms are developed to solve the proposed models. Numerical experiments demonstrate that the proposed models significantly outperform the compared ones.

Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Dec 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 3; 2023: 6; 2024: 2; 2025: 4; 2026: 1.

19 papers.

Sort:

  1. 2022Tensor Decompositions for Hyperspectral Data Processing in Remote Sensing: A Comprehensive Reviewcited by 9
  2. 2023SVDinsTN: A Tensor Network Paradigm for Efficient Structure Search from Regularized Modeling Perspectivecited by 9
  3. 2022Tensor Recovery Based on A Novel Non-convex Function Minimax Logarithmic Concave Penalty Functioncited by 7
  4. 2023Nonconvex Robust High-Order Tensor Completion Using Randomized Low-Rank Approximationcited by 7
  5. 2023Degradation-Noise-Aware Deep Unfolding Transformer for Hyperspectral Image Denoisingcited by 5
  6. 2023Handling The Non-Smooth Challenge in Tensor SVD: A Multi-Objective Tensor Recovery Frameworkcited by 2
  7. 2025Learnable Scaled Gradient Descent for Guaranteed Robust Tensor PCAcited by 2
  8. 2023Image Reconstruction using Superpixel Clustering and Tensor Completioncited by 1
  9. 2023Low-rank tensor completion via tensor joint rank with logarithmic composite normcited by 1
  10. 2024Haar Nuclear Norms with Applications to Remote Sensing Imagery Restorationcited by 1
  11. 2024LoRA-PT: Low-Rank Adapting UNETR for Hippocampus Segmentation Using Principal Tensor Singular Values and Vectorscited by 1
  12. 2021Multi-modal and frequency-weighted tensor nuclear norm for hyperspectral image denoisingcited by 0
7 more
  1. 2021Tensor Full Feature Measure and Its Nonconvex Relaxation Applications to Tensor Recoverycited by 0
  2. 2021"Sparse + Low-Rank'' Tensor Completion Approach for Recovering Images and Videoscited by 0
  3. 2022Low-Rank Tensor Completion Based on Bivariate Equivalent Minimax-Concave Penaltycited by 0
  4. 2025A novel non-convex minimax p-th order concave penalty function approach to low-rank tensor completioncited by 0
  5. 2025Accelerating Large-Scale Regularized High-Order Tensor Recoverycited by 0
  6. 20253DeepRep: 3D Deep Low-rank Tensor Representation for Hyperspectral Image Inpaintingcited by 0
  7. 2026Multi-Dimensional Visual Data Recovery: Scale-Aware Tensor Modeling and Accelerated Randomized Computationcited by 0