资源论文Robust Tensor Factorization with Unknown Noise

Robust Tensor Factorization with Unknown Noise

2019-12-20 | |  55 |   33 |   0

Abstract

Because of the limitations of matrix factorization, suchas losing spatial structure information, the concept of ten-sor factorization has been applied for the recovery of a lowdimensional subspace from high dimensional visual data.Generally, the recovery is achieved by minimizing the lossfunction between the observed data and the factorizationrepresentation. Under different assumptions of the noisedistribution, the loss functions are in various forms, like L1and L2 norms. However, real data are often corrupted by noise with an unknown distribution. Then any specific form of loss function for one specific kind of noise often fails to tackle such real data with unknown noise. In this paper, we propose a tensor factorization algorithm to model the noise as a Mixture of Gaussians (MoG). As MoG has the ability of universally approximating any hybrids of continuous distributions, our algorithm can effectively recover the low dimensional subspace from various forms of noisy observations. The parameters of MoG are estimated under the EM framework and through a new developed algorithm of weighted low-rank tensor factorization (WLRTF). The effectiveness of our algorithm are substantiated by extensive experiments on both of synthetic data and real image data.

上一篇:Kinematic Structure Correspondences via Hypergraph Matching

下一篇:Information Bottleneck Learning Using Privileged Information for Visual Recognition

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...