arrow
返回

Bayesian robust tensor completion via CP decomposition

delete2022-11-01
delete3
PRE
AI
X
Xiaohang Wang
P
Philip L. H. Yu *
W
Weidong Yang
苏
苏军 (Jun Su)
DOI:10.1016/j.patrec.2022.10.005delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The real-world tensor data are inevitably missing and corrupted with noise. Some models of the lowrank tensor factorization (LRTF) add an L1 norm or L2 norm to deal with the sparse or Gaussian noise. However, the real noise are usually complex. We propose a robust Bayesian tensor completion method, called MoG BTC-CP, which could impute the missing data and remove the complex noise simultaneously. The observed tensor is assumed to be the summation of a low-rank tensor and the noise. CP decomposition is proposed to extract the low-rank structure of the tensor. We assume that the noise follows a Mixture of Gaussian (MoG) distribution. A full Bayesian framework together with a Gibbs sampling algorithm is designed to estimate the model. Extensive experiments including synthetic data and real life applications show that MoG BTC-CP outperforms the recently published leading tensor completion and denoising methods.
Keyword:
Robust Tensor completion
Bayesian inference
Complex noise
Mixture of Gaussian (MoG) model

期刊

Pattern Recognition Letters 封面图
Pattern Recognition Letters
IF:
3.3
论文数:
8.0K
被引数:
1.6W

机构

F
fudan university
学者数:
11.8W
论文数: 7.7W
被引数: 121
S
Sun Yat Sen University
学者数:
9.9W
论文数: 7.2W
被引数: 95
引用论文

引用论文

err分享
err收藏
Judge Blocks Biological Warfare Laboratory
err1985-06-21
err0
PREAI
errR. Jeffrey Smith
err分享
err收藏
Total Daily Production and Periodicity of Melatonin Metabolite in Critically Ill Children*
err2020-07-16
err0
PREAI
errJennifer R. Foster; Janice A. Tijssen; Michael R. Miller; Jamie A. Seabrook; Douglas D. Fraser
err分享
err收藏
学者 查看更多内容