A Hybrid Truncated Norm Regularization Method for Matrix Completion

被引:12
|
作者
Ye, Hailiang [1 ]
Li, Hong [1 ]
Cao, Feilong [2 ]
Zhang, Liming [3 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Math & Stat, Wuhan 430074, Hubei, Peoples R China
[2] China Jiliang Univ, Coll Sci, Hangzhou 310018, Zhejiang, Peoples R China
[3] Univ Macau, Fac Sci & Technol, Macau 999078, Peoples R China
基金
中国国家自然科学基金;
关键词
Matrix completion; truncated norm; stability; image inpainting; RECOVERING LOW-RANK; NUCLEAR-NORM; ALGORITHM; SPARSE; ERROR;
D O I
10.1109/TIP.2019.2918733
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Matrix completion has been widely used in image processing, in which the popular approach is to formulate this issue as a general low-rank matrix approximation problem. This paper proposes a novel regularization method referred to as truncated Frobenius norm (TFN), and presents a hybrid truncated norm (HTN) model combining the truncated nuclear norm and truncated Frobenius norm for solving matrix completion problems. To address this model, a simple and effective two-step iteration algorithm is designed. Further, an adaptive way to change the penalty parameter is introduced to reduce the computational cost. Also, the convergence of the proposed method is discussed and proved mathematically. The proposed approach could not only effectively improve the recovery performance but also greatly promote the stability of the model. Meanwhile, the use of this new method could eliminate large variations that exist when estimating complex models, and achieve competitive successes in matrix completion. Experimental results on the synthetic data, real-world images, and recommendation systems, particularly the use of the statistical analysis strategy, verify the effectiveness and superiority of the proposed method, i.e., the proposed method is more stable and effective than the other state-of-the-art approaches.
引用
收藏
页码:5171 / 5186
页数:16
相关论文
共 50 条
  • [31] Adaptive and Implicit Regularization for Matrix Completion
    Li, Zhemin
    Sun, Tao
    Wang, Hongxia
    Wang, Bao
    SIAM JOURNAL ON IMAGING SCIENCES, 2022, 15 (04): : 2000 - 2022
  • [32] Constructive Regularization of the Random Matrix Norm
    Elizaveta Rebrova
    Journal of Theoretical Probability, 2020, 33 : 1768 - 1790
  • [33] Constructive Regularization of the Random Matrix Norm
    Rebrova, Elizaveta
    JOURNAL OF THEORETICAL PROBABILITY, 2020, 33 (03) : 1768 - 1790
  • [34] THE TRUNCATED SVD AS A METHOD FOR REGULARIZATION
    HANSEN, PC
    BIT, 1987, 27 (04): : 534 - 553
  • [35] Iterative rank-one matrix completion via singular value decomposition and nuclear norm regularization
    Xu, Kai
    Zhang, Ying
    Xiong, Zhi
    INFORMATION SCIENCES, 2021, 578 : 574 - 591
  • [36] Fractional Norm Regularization Using Truncated Singular Value Decomposition
    Tausiesakul, Bamrung
    Asavaskulkiet, Krissada
    IEEE ACCESS, 2024, 12 (36882-36895) : 36882 - 36895
  • [37] TRUNCATED WEIGHTED NUCLEAR NORM REGULARIZATION AND SPARSITY FOR IMAGE DENOISING
    Zhang, Ming Yan
    Zhang, Mingli
    Zhao, Feng
    Zhang, Fan
    Liu, Yepeng
    Evans, Alan
    2023 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, ICIP, 2023, : 1825 - 1829
  • [38] MINIMIZATION OF THE NORM, THE NORM OF THE INVERSE AND THE CONDITION NUMBER OF A MATRIX BY COMPLETION
    ELSNER, L
    HE, CY
    MEHRMANN, V
    NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 1995, 2 (02) : 155 - 171
  • [39] Image Completion with Global Structure and Weighted Nuclear Norm Regularization
    Zhang, Mingli
    Desrosiers, Christian
    2017 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2017, : 4187 - 4193
  • [40] A nonconvex nonsmooth regularization method for compressed sensing and low rank matrix completion
    Cui, Zhuo-Xu
    Fan, Qibin
    DIGITAL SIGNAL PROCESSING, 2017, 62 : 101 - 111