Abstract
Given Y ∈ R m×I and A ∈ R m×n , the multiple measurement vector (MMV) problem aims to recover the support of the K-row sparse matrix X from Y = AX + E. In this paper, we present a sufficient condition for exact support recovery of K-row sparse matrices via the orthogonal matching pursuit for MMV (OMPMMV) algorithm in the noisy case. Furthermore, in the noiseless case, our proposed condition is optimal.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have