Robust Iterative t-CUR (R-ItCUR), a tensor-native algorithm that partitions the sampled tensor cross into two exterior blocks and an intersection block, applies adaptive blockwise Welsch correction for outlier suppression, and updates the low-rank component through projected blockwise gradient descent is proposed.
Abstract
Tensor cross-concentrated sampling (t-CCS) bridges entrywise sampling and t-CUR slice-wise sampling by observing entries only within selected horizontal and lateral slices. Existing t-CCS completion methods, however, assume that the observations are free of gross corruption. In this work, we study robust recovery of a third-order low-tubal-rank tensor from partial t-CCS observations contaminated by sparse, arbitrarily large outliers. We propose Robust Iterative t-CUR (R-ItCUR), a tensor-native algorithm that partitions the sampled tensor cross into two exterior blocks and an intersection block, applies adaptive blockwise Welsch correction for outlier suppression, and updates the low-rank component through projected blockwise gradient descent. By operating directly on the sampled cross, R-ItCUR avoids reconstructing the full tensor throughout the iterations, resulting in substantial memory and computational savings. Experiments on synthetic tensors, cardiac MRI data, and three-dimensional seismic data demonstrate accurate recovery and strong robustness to sparse gross corruptions. The results further highlight the importance of explicitly exploiting the cross-concentrated sampling structure in robust tensor completion.
Robust tensor completion recovers multidimensional data from partial observations corrupted by sparse gross errors. Existing convolutional low-rank models typically construct translated copies using circular continuation, which introduces artificial wrap-around neighborhoods for finite nonperiodic data. We propose refl...
Wei-Guo Zhou, Feng Zhang, Wen-Jin Qin et al.· 0 citations
Tensor-product dictionaries improve the expressiveness of finite-dimensional Koopman models but produce exponentially large dense operators, while least-squares fitting is sensitive to incomplete and contaminated data. We propose a robust tensor Koopman operator (RTKO) estimator for fully observed current states and pa...
Lin-Xu Hu, Yu-Shu Gao, Zhao Sun et al.· Mathematics· 0 citations
We consider the recovery of low-multilinear-rank tensors from linear measurements and propose an adaptive block-weighted modewise Riemannian gradient descent method. The method combines memory-efficient modewise measurements with a normalized adaptive weighting strategy for the core and factor components of the Riemann...
Color images and video sequences can be modeled as 3-way tensors, which admit low tubal-rank approximations via convex surrogate minimization. This optimization problem is efficiently addressed by tensor singular value thresholding (t-SVT). To mitigate the computational burden of tensor singular value decomposition (t-...
A finite-step approximation guarantee that approaches the classical $1-1/e$ factor as direction certification becomes exact and finite-step residual error vanishes is established.
Tensor Robust Principal Component Analysis (TRPCA) aims to recover low-rank and sparse components from the noisy tensor data, which has attracted significant attention in visual data denoising. However, existing CANDECOMP/PARAFAC (CP) and Tucker decomposition methods fail to fully exploit inter-dimensional correlations...
Chang-Long Li, Ze-Can Yang, Laurence T. Yang et al.· IEEE Transactions on Image P...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.