3 datasets found

The dataset used in this paper is a low-rank matrix M, which can be decomposed into a low-rank component L∗ and a sparse error matrix S∗. The authors use this dataset to test...

This paper considers a large class of problems where we seek to recover a low rank matrix and/or sparse vector from some set of measurements.

This letter proposes to estimate low-rank matrices by formulating a convex optimization problem with non-convex regularization. We employ parameterized non-convex penalty...