On the Fundamental Limit of Orthogonal Matching Pursuit for Multiple Measurement Vector

On the Fundamental Limit of Orthogonal Matching Pursuit for Multiple Measurement Vector

Given Y &#x2208; R<sup>m&#x00D7;I</sup> and A &#x2208; R<sup>m&#x00D7;n</sup>, 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 su...

Full description

Bibliographic Details
Main Authors: Haifeng Li, Libo Wang, Xueqiu Zhan, Deepak Kumar Jain
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Compressed sensing
multiple measurement vector
greedy algorithm
Online Access:https://ieeexplore.ieee.org/document/8675369/

Internet

https://ieeexplore.ieee.org/document/8675369/

Similar Items