Hybrid Matrix Completion Model for Improved Images Recovery and Recommendation Systems

被引:4
作者
Xu, Kai [1 ,2 ]
Zhang, Ying [3 ]
Dong, Zhurong [2 ]
Li, Zhanyu [2 ]
Fang, Bopeng [2 ]
机构
[1] South China Univ Technol, Sch Software Engn, Guangzhou 510006, Peoples R China
[2] Shenzhen Polytech, Sch Automot & Transportat Engn, Shenzhen 518055, Peoples R China
[3] Shantou Univ, Med Coll, Affiliated Hosp 2, Dept Informat, Shantou 515041, Peoples R China
关键词
Sparse matrices; Matrix decomposition; Adaptive filters; Information filters; Minimization; Convolution; Adaptation models; Matrix completion; images recovery; recommendation systems; adaptive local filtering; FACTORIZATION; ALGORITHMS;
D O I
10.1109/ACCESS.2021.3125152
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Matrix completion methods have been widely applied in images recovery and recommendation systems. Most of them are only based on the low-rank characteristics of matrices to predict the missing entries. However, these methods lack consideration of local information. To further improve the performance of matrix completion. In this paper, we propose a novel model based on matrix decompositions and matrix local information. Specifically, we update a number of rank-one matrices, which circumvented the rank estimation in matrix decomposition. And a penalty function is designed to punish singular values without introducing additional parameters. The local information component extracts similar information by an adaptive filter via convolution operation which kernel is obtained by the minimum variance. Finally, we integrate matrix decomposition and local information components via different weights. We apply the proposed method to real-world image datasets and recommendation system datasets. The experimental results demonstrate the proposed model has a lower error and better robustness than several competing matrix completion methods.
引用
收藏
页码:149349 / 149359
页数:11
相关论文
共 41 条
[1]   A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION [J].
Cai, Jian-Feng ;
Candes, Emmanuel J. ;
Shen, Zuowei .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) :1956-1982
[2]   Exact Matrix Completion via Convex Optimization [J].
Candes, Emmanuel ;
Recht, Benjamin .
COMMUNICATIONS OF THE ACM, 2012, 55 (06) :111-119
[3]   Matrix completion from a computational statistics perspective [J].
Chi, Eric C. ;
Li, Tianxi .
WILEY INTERDISCIPLINARY REVIEWS-COMPUTATIONAL STATISTICS, 2019, 11 (05)
[4]  
Chiang KY, 2015, ADV NEUR IN, V28
[5]   Accelerated low-rank representation for subspace clustering and semi-supervised classification on large-scale data [J].
Fan, Jicong ;
Tian, Zhaoyang ;
Zhao, Mingbo ;
Chow, Tommy W. S. .
NEURAL NETWORKS, 2018, 100 :39-48
[6]   Matrix completion by deep matrix factorization [J].
Fan, Jicong ;
Cheng, Jieyu .
NEURAL NETWORKS, 2018, 98 :34-41
[7]   Sparse subspace clustering for data with missing entries and high-rank matrix completion [J].
Fan, Jicong ;
Chow, Tommy W. S. .
NEURAL NETWORKS, 2017, 93 :36-44
[8]   Flexible Low-Rank Statistical Modeling with Missing Data and Side Information [J].
Fithian, William ;
Mazumder, Rahul .
STATISTICAL SCIENCE, 2018, 33 (02) :238-260
[9]   Weighted Nuclear Norm Minimization and Its Applications to Low Level Vision [J].
Gu, Shuhang ;
Xie, Qi ;
Meng, Deyu ;
Zuo, Wangmeng ;
Feng, Xiangchu ;
Zhang, Lei .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2017, 121 (02) :183-208
[10]   Matrix Factorization With Rating Completion: An Enhanced SVD Model for Collaborative Filtering Recommender Systems [J].
Guan, Xin ;
Li, Chang-Tsun ;
Guan, Yu .
IEEE ACCESS, 2017, 5 :27668-27678