期刊论文

Zhang, Xiongjun(xjzhang@mail.ccnu.edu.cn)

英文

Applied and Computational Harmonic Analysis

1063-5203

2023

65

348-373

10.1016/j.acha.2023.03.007

The research of G.-J. Song was supported in part by the National Natural Science Foundation of China under Grant 12171369 and Key NSF of Shandong Province under Grant ZR2020KA008 . The research of M. K. Ng was supported in part by the HKRGC GRF 12300519 , 17201020 , and 17300021 , HKRGC CRF C1013-21GF and C7004-21GF , and Joint NSFC and RGC N-HKU769/21 . The research of X. Zhang was supported in part by the National Natural Science Foundation of China under Grant No. 12171189 and the Knowledge Innovation Project of Wuhan under Grant No. 2022010801020279 .

本校为其他机构

One of the key problems in tensor completion is the number of uniformly random sample entries required for recovery guarantee. The main aim of this paper is to study n1×n2×n3 third-order tensor completion based on transformed tensor singular value decomposition, and provide a bound on the number of required sample entries. Our approach is to make use of the multi-rank of the underlying tensor instead of its tubal rank in the bound. In numerical experiments on synthetic and imaging data sets, we demonstrate the effectiveness of our proposed bo...