.png){kind=icon}
返回
Stable Tensor Principal Component Pursuit: Error Bounds and Efficient Algorithms
.png){kind=icon}
OA
AI
DOI：10.3390/s19235335.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The rapid development of sensor technology gives rise to the emergence of huge amounts of tensor (i.e., multi-dimensional array) data. For various reasons such as sensor failures and communication loss, the tensor data may be corrupted by not only small noises but also gross corruptions. This paper studies the Stable Tensor Principal Component Pursuit (STPCP) which aims to recover a tensor from its corrupted observations. Specifically, we propose a STPCP model based on the recently proposed tubal nuclear norm (TNN) which has shown superior performance in comparison with other tensor nuclear norms. Theoretically, we rigorously prove that under tensor incoherence conditions, the underlying tensor and the sparse corruption tensor can be stably recovered. Algorithmically, we first develop an ADMM algorithm and then accelerate it by designing a new algorithm based on orthogonal tensor factorization. The superiority and efficiency of the proposed algorithms is demonstrated through experiments on both synthetic and real data sets.
Keyword:
tensor principal component pursuit
stable recovery
tensor SVD
ADMM
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.3W
被引数:
20.9W
机构
引用论文
DC Offset Error Compensation Algorithm for PR Current Control of a Single-Phase Grid-Tied Inverter.png)
Energies
OAAI
EnergiesIF0
OAAI分享收藏分享收藏分享收藏5D seismic data completion and denoising using a novel class of tensor decompositionsGEOPHYSICSOAAI
GEOPHYSICSIF3.2
OAAI分享收藏
查看更多内容