Abstract | ||
---|---|---|
A new theory known as compressed sensing considers the problem to acquire and recover a sparse signal from its linear measurements. In this paper, we propose a new support recovery algorithm from noisy measurements based on the linear programming (LP). LP is widely used to estimate sparse signals, however, we focus on the problem to recover the support of sparse signals rather than the problem to estimate sparse signals themselves. First, we derive an integer linear programming (ILP) formulation for the support recovery problem. Then we obtain the LP based support recovery algorithm by relaxing the ILP. The proposed LP based recovery algorithm has an attracting property that the output of the algorithm is guaranteed to be the maximum a posteiori (MAP) estimate when it is integer valued. We compare the performance of the proposed algorithm to a state-of-the-art algorithm named sparse matching pursuit (SMP) via numerical simulations. |
Year | Venue | Keywords |
---|---|---|
2016 | 2016 International Symposium on Information Theory and Its Applications (ISITA) | sparse signal support recovery algorithm,integer linear programming formulation,compressed sensing,sparse signal acquisition,linear measurements,noisy measurements,sparse signal estimation,ILP,maximum-a-posteiori estimate,MAP estimate |
Field | DocType | ISBN |
Integer,Matching pursuit,Mathematical optimization,Computer science,Sparse approximation,Integer programming,Linear programming,Probability of error,Compressed sensing,Sparse matrix | Conference | 978-1-5090-1917-5 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Shunsuke Horii | 1 | 0 | 3.72 |
Toshiyasu Matsushima | 2 | 97 | 32.76 |
Shigeichi Hirasawa | 3 | 322 | 150.91 |