摘要
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.
学科与关键词
- Matrix Completion Based on Low-Rank and Local Features Applied to Images Recovery and Recommendation SystemsZhang, Ying; Xu, Kai; Liang, Songfeng*; Zhao, Chen*IEEE Access, 2022, 10: 97010-97021.
- Adaptive Rank-One Matrix Completion Using Sum of Outer ProductsWang, Zhi-Yong; Li, Xiao Peng*; So, Hing Cheung*; Zoubir, Abdelhak M.IEEE Transactions on Circuits and Systems for Video Technology, 2023, 33(9): 4868-4880.
- Fast and robust rank-one matrix completion via maximum correntropy criterion and half-quadratic optimizationWang, Zhi-Yong*; So, Hing Cheung; Liu, ZhaofengSIGNAL PROCESSING, 2022, 198: 108580.被引 3
