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

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.

[1]  Zhi-Pei Liang,et al.  Spatiotemporal Imaging with Partially Separable Functions , 2007, 2007 Joint Meeting of the 6th International Symposium on Noninvasive Functional Source Imaging of the Brain and Heart and the International Conference on Functional Biomedical Imaging.

[2]  Pierre Vandergheynst,et al.  Compressed Sensing of Simultaneous Low-Rank and Joint-Sparse Matrices , 2012, ArXiv.

[3]  Jie Chen,et al.  Theoretical Results on Sparse Representations of Multiple-Measurement Vectors , 2006, IEEE Transactions on Signal Processing.

[4]  Alan Edelman,et al.  Tails of Condition Number Distributions , 2005, SIAM J. Matrix Anal. Appl..

[5]  Zhi-Pei Liang,et al.  SPATIOTEMPORAL IMAGINGWITH PARTIALLY SEPARABLE FUNCTIONS , 2007, 2007 4th IEEE International Symposium on Biomedical Imaging: From Nano to Macro.

[6]  Junfeng Yang,et al.  Alternating Direction Algorithms for 1-Problems in Compressive Sensing , 2009, SIAM J. Sci. Comput..

[7]  Mathews Jacob,et al.  Accelerated Dynamic MRI Exploiting Sparsity and Low-Rank Structure: k-t SLR , 2011, IEEE Transactions on Medical Imaging.