缺少数据
计算机科学
算法
Tikhonov正则化
排
矩阵完成
平滑度
人工智能
正规化(语言学)
离群值
趋同(经济学)
图像复原
基质(化学分析)
迭代重建
矩阵分解
基本矩阵(线性微分方程)
模式识别(心理学)
数学优化
数学
傅里叶变换
图像处理
正交性
张量(固有定义)
稀疏矩阵
图像(数学)
矩阵范数
最优化问题
信号处理
先验与后验
利用
行和列空间
多样性(控制论)
数据挖掘
作者
Hao Nan Sheng,Zhi-Yong Wang,Hing Cheung So,Abdelhak M. Zoubir
标识
DOI:10.1109/tpami.2025.3616607
摘要
A common assumption in matrix completion (MC) and tensor completion (TC) is that the missing locations are sampled randomly. However, in real-world scenarios, the unobserved elements are often not arbitrarily located, and may concentrate within entire rows or columns. We refer to this missing mechanism as structural missingness, and traditional MC and TC schemes suffer from drastic degradation under these circumstances. This work addresses the challenge of restoring structural missingness by introducing a novel framework for simultaneously reconstructing multiple matrices, called multi-matrix completion (MMC). In MMC, tri-factorization across matrices captures the correlation between matrices, and Tikhonov regularization on each matrix exploits its correlation. This design enables MMC to efficiently handle both random and structural missingness. In addition, MMC is not affected by the smoothness along matrices which makes it suitable for a wider variety of data compared to Fourier transform based TC methods. The alternating direction method of multipliers is utilized to solve the resultant optimization problem. The global convergence of the algorithm is supported by comprehensive theoretical analyses. We demonstrate the versatility of MMC through extensive experiments in image and video restoration, and showcase its superior performance in comparison to traditional MC and TC methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI