Improved bounds for sparse recovery from subsampled random convolutions (Q1634177): Difference between revisions

This paper studies the recovery of sparse vectors from subsampled random convolutions by \(l_1\) minimization. The authors provide some lower bounds of measuring times for recovering sparse vectors with high probability. The main result improves many known theorems, which include the corresponding estimations in [\textit{F. Krahmer} et al., Commun. Pure Appl. Math. 67, No. 11, 1877--1904 (2014; Zbl 1310.94024)], and in [\textit{J. Romberg}, SIAM J. Imaging Sci. 2, No. 4, 1098--1128 (2009; Zbl 1176.94017)].