Computer Science – Information Theory
Scientific paper
2009-04-14
IEEE Trans. Info. Theory, 56(5):2516-2527, 2010
Computer Science
Information Theory
19 pages, 9 figures
Scientific paper
10.1109/TIT.2010.2043876
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 $\ell_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 $\ell_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.
den Berg Ewout van
Friedlander Michael P.
No associations
LandOfFree
Joint-sparse recovery from multiple measurements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Joint-sparse recovery from multiple measurements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Joint-sparse recovery from multiple measurements will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-98299