Robust Online Matrix Completion With Gaussian Mixture Model

In this paper, we study the problem of online matrix completion (MC) aiming to achieve robustness to the variations in both low-rank subspace and noises. In contrast to existing methods, we progressively fit a specific Gaussian Mixture Model (GMM) for noi
  • IEEE MemberUS $11.00
  • Society MemberUS $0.00
  • IEEE Student MemberUS $11.00
  • Non-IEEE MemberUS $15.00

Videos in this product