Two step recovery of jointly sparse and low-rank matrices: theoretical guarantees

12/05/2014
by   Sampurna Biswas, et al.
0

We introduce a two step algorithm with theoretical guarantees to recover a jointly sparse and low-rank matrix from undersampled measurements of its columns. The algorithm first estimates the row subspace of the matrix using a set of common measurements of the columns. In the second step, the subspace aware recovery of the matrix is solved using a simple least square algorithm. The results are verified in the context of recovering CINE data from undersampled measurements; we obtain good recovery when the sampling conditions are satisfied.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset