期刊
IEEE TRANSACTIONS ON SIGNAL PROCESSING
卷 58, 期 1, 页码 269-280出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSP.2009.2027773
关键词
Bayesian inference; belief propagation; compressive sensing; fast algorithms; sparse matrices
资金
- NSF [CCF-0431150, CCF-0728867]
- DARPA/ONR [N66001-08-1-2065]
- ONR [N00014-07-1-0936, N00014-08-1-1112]
- AFOSR [FA9550-07-1-0301]
- ARO MURI [W311NF-07-1-0185]
- Texas Instruments Leadership University
Compressive sensing (CS) is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable, sub-Nyquist signal acquisition. When a statistical characterization of the signal is available, Bayesian inference can complement conventional CS methods based on linear programming or greedy algorithms. We perform asymptotically optimal Bayesian inference using belief propagation (BP) decoding, which represents the CS encoding matrix as a graphical model. Fast computation is obtained by reducing the size of the graphical model with sparse encoding matrices. To decode a length-N signal containing K large coefficients, our CS-BP decoding algorithm uses O(K log(N)) measurements and O(N log(2)(N)) computation. Finally, although we focus on a two-state mixture Gaussian model, CS-BP is easily adapted to other signal models.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据