Improved bounds for sparse recovery from subsampled random convolutions (Q1634177): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q327268 |
||
| Property / reviewed by | |||
| Property / reviewed by: You Ming Liu / rank | |||
Revision as of 10:06, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved bounds for sparse recovery from subsampled random convolutions |
scientific article |
Statements
Improved bounds for sparse recovery from subsampled random convolutions (English)
0 references
17 December 2018
0 references
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)].
0 references
compressive sensing
0 references
circulant matrix
0 references
sparsity
0 references
small ball estimates
0 references
generic chaining
0 references
