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 条
[51]  
Li T., Ma J., T-SVD based non-convex tensor completion and robust principal component analysis, 2020 25th International Conference on Pattern Recognition (ICPR), pp. 6980-6987, (2021)
[52]  
Yang M., Luo Q., Li W., Xiao M., Nonconvex 3D array image data recovery and pattern recognition under tensor framework, Pattern Recognit., 122, (2022)
[53]  
Gao K., Huang Z.-H., Tensor robust principal component analysis via tensor fibered rank and L<sub>p</sub> minimization, SIAM J. Imaging Sci., 16, 1, pp. 423-460, (2023)
[54]  
Shi Q., Cheung Y.-M., Lou J., Robust tensor svd and recovery with rank estimation, IEEE Trans. Cybern., 52, 10, pp. 10667-10682, (2021)
[55]  
Zheng Y.-B., Huang T.-Z., Zhao X.-L., Jiang T.-X., Ji T.-Y., Ma T.-H., Tensor n-tubal rank and its convex relaxation for low-rank tensor recovery, Inform. Sci., 532, pp. 170-189, (2020)
[56]  
Rockafellar T.R., Wets R.J.-B., Variational Analysis, (2009)
[57]  
Bolte J., Sabach S., Teboulle M., Proximal alternating linearized minimization for nonconvex and nonsmooth problems, Math. Program., 146, 1-2, pp. 459-494, (2014)
[58]  
Clarke F.H., Optimization and Nonsmooth Analysis, (1990)
[59]  
Ochs P., Dosovitskiy A., Brox T., Pock T., On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision, SIAM J. Imaging Sci., 8, 1, pp. 331-372, (2015)
[60]  
Wang Z., Bovik A.C., Sheikh H.R., Simoncelli E.P., Image quality assessment: from error visibility to structural similarity, IEEE Trans. Image Process., 13, 4, pp. 600-612, (2004)