Name
Title | ||
|---|---|---|
Nearly Sharp Restricted Isometry Condition Of Rank Aware Order Recursive Matching Pursuit |
Abstract | ||
|---|---|---|
In this paper, we analyze the performance guarantee of the rank aware order recursive matching pursuit (RA-ORMP) algorithm in recovering a group of jointly sparse vectors. Specifically, we show that RA-ORMP accurately reconstructs any group of l linearly independent jointly K-sparse vectors, provided that a sampling matrix satisfies the restricted isometry property (RIP) of order K + 1 withdelta(K+1) < root l/root K + l/4 + root l/4.Furthermore, we show the near-optimality of the proposed guarantee by providing a group of l jointly K-sparse vectors that cannot be recovered by RA-ORMP underdelta(K+1) >= root l/K. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ISIT.2019.8849290 | 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
Field | DocType | Citations |
Matching pursuit,Discrete mathematics,Combinatorics,Linear independence,Computer science,Matrix (mathematics),Performance guarantee,Isometry,Restricted isometry property,Recursion | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Junhan Kim | 1 | 9 | 4.55 |
| Byonghyo Shim | 2 | 937 | 88.51 |