Sparse Blind Deconvolution and Demixing Through -Minimization
arXiv:1609.06357 · doi:10.1007/s10444-017-9533-0
Abstract
This paper concerns solving the sparse deconvolution and demixing problem using -minimization. We show that under a certain structured random model, robust and stable recovery is possible. The results extend results of Ling and Strohmer [Self Calibration and Biconvex Compressive Sensing, Inverse Problems, 2015], and in particular theoretically explain certain experimental findings from that paper. Our results do not only apply to the deconvolution and demixing problem, but to recovery of column-sparse matrices in general.
arXiv commentChanges in v2: A few errors were fixed, resulting in slightly different results. Also, some efforts were made to increase readability. Changes in v3: Version accepted for publication
References in corpus (5)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- User-friendly tail bounds for sums of random matrices
- Recovering low-rank matrices from few coefficients in any basis
- Self-Calibration and Biconvex Compressive Sensing
- Channel Protection: Random Coding Meets Sparse Channels