正规化(语言学)
秩(图论)
张量(固有定义)
规范(哲学)
趋同(经济学)
矩阵范数
计算机科学
数学优化
数学
应用数学
算法
人工智能
组合数学
纯数学
特征向量
物理
政治学
法学
量子力学
经济
经济增长
作者
Lulu Guo,Kaixin Gao,Zheng‐Hai Huang
出处
期刊:Neurocomputing
[Elsevier BV]
日期:2023-03-03
卷期号:534: 171-186
被引量:1
标识
DOI:10.1016/j.neucom.2023.02.052
摘要
Low rank tensor recovery (LRTR) problem has attracted wide attentions and researches, and has been applied to various fields. In this paper, we mainly consider the nonconvex relaxtion methods for LRTR. Firstly, we newly propose the tensor schatten capped p (SCp) norm as a nonconvex surrogate of the tensor tubal rank, which can provide a closer approximation of the tubal rank compared with some existing nonconvex approximations. Secondly, we introduce an implicit Plug-and-Play (PnP)-based regularization into the nonconvex model to further improve the recovered performance. The proposed model is abbreviated as SCp-PnP. Based on the alternating direction method of multipliers, we propose an efficient algorithm to solve SCp-PnP. The convergence of this algorithm is also provided. Finally, extensive experiments on different kinds of datasets show that our method significantly outperforms several state-of-the-art LRTR methods in terms of both quality metrics and visual effects.
科研通智能强力驱动
Strongly Powered by AbleSci AI