改进的鲁棒低秩正则化张量填充
Improved Robust Low-Rank Regularization Tensor Completion
DOI: 10.12677/AAM.2022.1111809, PDF,    科研立项经费支持
作者: 王香懿:辽宁师范大学,辽宁 大连;姜 伟:辽宁师范大学,辽宁 大连;温州大学,浙江 温州
关键词: 张量填充加权张量核范数加权张量Frobenius范数Tensor Completion Weighted Tensor Nuclear Norm Weighted Tensor Frobenius Norm
摘要: 考虑到传统张量核范数作为秩函数的凸松弛在实际优化效果上的不足,本文借助非凸松弛的思想,提出了由加权张量核范数和加权张量Frobenius范数组合而成的新的非凸的张量填充模型,并运用交替方向乘子法求解所提出的低秩张量恢复模型。在张量填充方面,该模型在PSNR指标和视觉感知方面均优于传统方法,也取得了比传统算法更好的性能。
Abstract: Considering the deficiency of the convex relaxation of the traditional tensor nuclear norm as a rank function in the actual optimization effect, this paper proposes a new non convex tensor completion model composed of weighted tensor nuclear norm and weighted tensor Frobenius norm by virtue of the idea of non convex relaxation, and uses the alternating direction multiplier method to solve the proposed low rank tensor recovery model. In terms of tensor filling, the model is superior to the traditional methods in terms of PSNR index and visual perception, and has achieved better perfor-mance than the traditional algorithm.
文章引用:王香懿, 姜伟. 改进的鲁棒低秩正则化张量填充[J]. 应用数学进展, 2022, 11(11): 7647-7652. https://doi.org/10.12677/AAM.2022.1111809

参考文献

[1] Sidiropoulos, N.D., De Lathauwer, L., Fu, X., et al. (2017) Tensor Decomposition for Signal Processing and Machine Learning. IEEE Transactions on Signal Processing, 65, 3551-3582. [Google Scholar] [CrossRef
[2] Lai, Z., Wong, W.K, Jin, Z., et al. (2012) Sparse Approximation to the Eigensubspace for Discrimination. IEEE Transactions on Neural Networks and Learning Systems, 23, 1948-1960. [Google Scholar] [CrossRef
[3] De Lathauwer, L. and De Moor, B. (1998) From Matrix to Tensor: Multilinear Algebra and Signal Processing. Institute of Mathematics and Its Applications Conference Series, Oxford University Press, Oxford, 1-16.
[4] Tucker, L.R. (1966) Some Mathematical Notes on Three-Mode Factor Analysis. Psychometrika, 31, 279-311. [Google Scholar] [CrossRef
[5] Kiers, H.A. (20008) Towards a Standardized Notation and Terminology in Multiway Analysis. Journal of Chemometrics, 14, 105-122. [Google Scholar] [CrossRef
[6] Liu, J., Musialski, P., Wonka, P. and Ye, J. (2013) Tensor Completion for Estimating Missing Values in Visual Data. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35, 208-220. [Google Scholar] [CrossRef
[7] Kilmer, M.E. and Martin, C.D. (2011) Factorization Strategies for Third-Order Tensors. Linear Algebra and Its Applications, 435, 641-658. [Google Scholar] [CrossRef
[8] Lu, C., Feng, J., Liu, W., Lin, Z. and Yan, S. (2020) Tensor Robust Principal Component Analysis with a New Tensor Nuclear Norm. IEEE Transactions on Pattern Analysis and Machine Intelligence, 42, 925-938.
[9] Xu, W., Zhao, X., Ji, T., et al. (2019) Laplace Function Based Nonconvex Surrogate for Low-Rank Tensor Completion. Signal Processing: Image Communication, 73, 62-69. [Google Scholar] [CrossRef
[10] Cai, S., Luo, Q., Yang, M., et al. (2019) Tensor Robust Principal Component Analysis via Non-Convex Low Rank Approximation. Applied Sciences, 9, Article No. 1411. [Google Scholar] [CrossRef
[11] Li, T. and Ma, J. (2019) Non-Convex Penalty for Tensor Completion and Robust PCA. ArXiv: 1904.10165.
[12] Kong, H., Xie, X. and Lin, Z. (2018) t-Schatten-p Norm for Low-Rank Tensor Recovery. IEEE Journal of Selected Topics in Signal Processing, 12, 1405-1419. [Google Scholar] [CrossRef