Tensor recovery based on rank adaptive and non-convex methods

被引:0
作者
Liu C. [1 ]
Zhang H. [1 ]
Fan H. [1 ]
Li Y. [1 ]
机构
[1] Department of Information and Computing Science, College of Science, Northwest A&F University, Yangling, Shaanxi
来源
Optik | 2023年 / 292卷
关键词
Minimax logarithmic concave penalty; Rank adaptive; Tensor recovery;
D O I
10.1016/j.ijleo.2023.171396
中图分类号
学科分类号
摘要
The growing popularity of tensor singular value decomposition (T-SVD) in tensor recovery problems and the N-tubal rank can be applied to higher order tensors. However, this method faces new challenges as it does not fully use the rank prior information of tensors and lacks non-convex relaxation methods. Thus, this paper applies a new non-convex function, called Minimax Logarithmic Concave Penalty (MLCP), based on the N-tubal rank method. Two MLCP models based on N-tubal rank are introduced for solving low-rank tensor completion (LRTC) and tensor robust principal component analysis (TRPCA) problems, along with corresponding solving algorithms. The effectiveness and superiority of these models are demonstrated through experiments on real datasets. © 2023 Elsevier GmbH
引用
收藏
相关论文
共 67 条
[31]  
Li X., Ye Y., Xu X., Low-rank tensor completion with total variation for visual data inpainting, 31, (2017)
[32]  
Liu J., Musialski P., Wonka P., Ye J., Tensor completion for estimating missing values in visual data, IEEE Trans. Pattern Anal. Mach. Intell., 35, 1, pp. 208-220, (2012)
[33]  
Ji T.-Y., Huang T.-Z., Zhao X.-L., Ma T.-H., Deng L.-J., A non-convex tensor rank approximation for tensor completion, Appl. Math. Model., 48, pp. 410-422, (2017)
[34]  
Kilmer M.E., Braman K., Hao N., Hoover R.C., Third-order tensors as operators on matrices: A theoretical and computational framework with applications in imaging, SIAM J. Matrix Anal. Appl., 34, 1, pp. 148-172, (2013)
[35]  
Zhang Z., Aeron S., Exact tensor completion using t-svd, IEEE Trans. Signal Process., 65, 6, pp. 1511-1526, (2016)
[36]  
Zhou P., Lu C., Lin Z., Zhang C., Tensor factorization for low-rank tensor completion, IEEE Trans. Image Process., 27, 3, pp. 1152-1163, (2017)
[37]  
Hillar C.J., Lim L.-H., Most tensor problems are np-hard, J. ACM, 60, 6, pp. 1-39, (2013)
[38]  
Semerci O., Hao N., Kilmer M.E., Miller E.L., Tensor-based formulation and nuclear norm regularization for multienergy computed tomography, IEEE Trans. Image Process., 23, 4, pp. 1678-1693, (2014)
[39]  
Lu C., Feng J., Chen Y., Liu W., Lin Z., Yan S., Tensor robust principal component analysis with a new tensor nuclear norm, IEEE Trans. Pattern Anal. Mach. Intell., 42, 4, pp. 925-938, (2019)
[40]  
Zhou P., Feng J., Outlier-robust tensor pca, pp. 2263-2271, (2017)