ProV Logo
0
Joint-sparse recovery from multiple meas...
Berg, Ewout van den...

Free

Joint-sparse recovery from multiple measurements by Berg, Ewout van den ( Author )
Lemonjar Open Access
-
14-01-2009
The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an extension of the single-measurement-vector (SMV) problem widely studied in compressed sensing. We analyze the recovery properties for two types of recovery algorithms. First, we show that recovery using sum-of-norm minimization cannot exceed the uniform recovery rate of sequential SMV using ℓ1 minimization, and that there are problems that can be solved with one approach but not with the other. Second, we analyze the performance of the ReMBo algorithm [M. Mishali and Y. Eldar, IEEE Trans. Sig. Proc., 56 (2008)] in combination with ℓ1 minimization, and show how recovery improves as more measurements are taken. From this analysis it follows that having more measurements than number of nonzero rows does not improve the potential theoretical recovery rate.
-
Article
pdf
36.88 KB
English
-
MYR 0.00
-
https://arxiv.org/abs/0904.2051
Share this eBook