ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Robust Tensor Completion via Capped Frobenius Norm

Li, Xiao Peng; Wang, Zhi-Yong*; Shi, Zhang-Lei; So, Hing Cheung*; Sidiropoulos, Nicholas D.
IEEE Transactions on Neural Networks and Learning Systems2023-1-23DOI: 10.1109/TNNLS.2023.3236415
4被引4阅读
引用收藏
分享

摘要

Tensor completion (TC) refers to restoring the missing entries in a given tensor by making use of the low-rank structure. Most existing algorithms have excellent performance in Gaussian noise or impulsive noise scenarios. Generally speaking, the Frobenius-norm-based methods achieve excellent performance in additive Gaussian noise, while their recovery severely degrades in impulsive noise. Although the algorithms using the l(p)-norm (0 < p < 2) or its variants can attain high restoration accuracy in the presence of gross errors, they are inferior to the Frobenius-norm-based methods when the noise is Gaussian-distributed. Therefore, an approach that is able to perform well in both Gaussian noise and impulsive noise is desired. In this work, we use a capped Frobenius norm to restrain outliers, which corresponds to a form of the truncated least-squares loss function. The upper bound of our capped Frobenius norm is automatically updated using normalized median absolute deviation during iterations. Therefore, it achieves better performance than the l(p)-norm with outlier-contaminated observations and attains comparable accuracy to the Frobenius norm without tuning parameter in Gaussian noise. We then adopt the half-quadratic theory to convert the nonconvex problem into a tractable multivariable problem, that is, convex optimization with respect to (w.r.t.) each individual variable. To address the resultant task, we exploit the proximal block coordinate descent ( PBCD) method and then establish the convergence of the suggested algorithm. Specifically, the objective function value is guaranteed to be convergent while the variable sequence has a subsequence converging to a critical point. Experimental results based on real-world images and videos exhibit the superiority of the devised approach over several state-of-the-art algorithms in terms of recovery performance. MATLAB code is available at https://github.com/Li-X-P/Codeof-Robust-Tensor-Completion.

学科与关键词

关键词
Capped Frobenius normproximal block coordinate descentrobust recoverytensor completion (TC)tensor ring
相关
加载中…
  • Robust low-rank tensor completion via transformed tensor nuclear norm with total variation regularization
    Qiu, Duo; Bai, Minru*; Ng, Michael K.; Zhang, XiongjunNEUROCOMPUTING, 2021, 435: 197-215.被引 24
  • Nonconvex Optimization for Robust Tensor Completion from Grossly Sparse Observations
    Zhao Xueying; Bai Minru; Ng Michael K.Journal of Scientific Computing, 2020, 85(2).
  • Robust Low Transformed Multi-Rank Tensor Completion With Deep Prior Regularization for Multi-Dimensional Image Recovery
    Li, Yao; Qiu, Duo*; Zhang, XiongjunIEEE Transactions on Big Data, 2023, 9(5): 1288-1301.
查看全部 →

发表信息

论文状态
公开发表
期刊
IEEE Transactions on Neural Networks and Learning Systems
发表日期
2023-01-23
DOI
10.1109/TNNLS.2023.3236415
语言
ENGLISH
成果收录
SCIE
资助标注
Research Grants Council of the Hong Kong Special Administrative Region, China [CityU 11201421, CityU 11207922]; Fundamental Research Funds for the Central Universities [22CX06039A]

作者

  • L

    Li, Xiao Peng (第一作者)

  • W

    Wang, Zhi-Yong (通讯)

查看全部 5 位作者收起作者
  • S

    Shi, Zhang-Lei

  • S

    So, Hing Cheung (通讯)

  • S

    Sidiropoulos, Nicholas D.

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417