2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | G.3.5 | ||
| Paper Title | A Novel B-MAP Proxy for Greedy Sparse Signal Recovery Algorithms | ||
| Authors | Jeongmin Chae, Song-Nam Hong, Ajou University, Korea (South) | ||
| Session | G.3: Compressed Sensing | ||
| Presentation | Lecture | ||
| Track | Graphs, Games, Sparsity, and Signal Processing | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | We propose a novel greedy algorithm to recover a sparse signal from a small number of noisy measurements. In the proposed method, a new support index is identified for each iteration, based on bit-wise maximum a posteriori (B-MAP) detection. This approach is optimal in the sense of detecting one of the remaining support indices, provided that all the indices during the previous iterations are perfectly recovered. Unfortunately, the exact computation of B-MAP detection is not practical since it requires a heavy marginalization of a high-dimensional sparse vector to compute a posteriori probability of each remaining support. Our major contribution is to present a good proxy, named B-MAP proxy, on the a posteriori probability. The proposed proxy is easily evaluated only using vector correlations as in popular orthogonal matching pursuit (OMP) and accurate enough to represent a relative ordering on the probabilities. Via simulations, we demonstrate that the proposed greedy algorithm yields a higher recovery accuracy than the existing benchmark methods as OMP and MAP-OMP, having the same computational complexity. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
