GENERALIZED APPROXIMATE MESSAGE PASSING FOR COSPARSE ANALYSIS COMPRESSIVE SENSING

被引:0
作者
Borgerding, Mark [1 ]
Schniter, Philip [1 ]
Vila, Jeremy [1 ]
Rangan, Sundeep [2 ]
机构
[1] Ohio State Univ, Dept ECE, Columbus, OH 43210 USA
[2] NYU Polytech Inst, Dept ECE, Brooklyn, NY 11201 USA
来源
2015 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING (ICASSP) | 2015年
基金
美国国家科学基金会;
关键词
Approximate message passing; belief propagation; compressed sensing; PRIMAL-DUAL ALGORITHMS; SPARSITY;
D O I
暂无
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
In cosparse analysis compressive sensing (CS), one seeks to estimate a non-sparse signal vector from noisy sub-Nyquist linear measurements by exploiting the knowledge that a given linear transform of the signal is cosparse, i.e., has sufficiently many zeros. We propose a novel approach to cosparse analysis CS based on the generalized approximate message passing (GAMP) algorithm. Unlike other AMP-based approaches to this problem, ours works with a wide range of analysis operators and regularizers. In addition, we propose a novel l(0)-like soft-thresholder based on MMSE denoising for a spike-and-slab distribution with an infinite-variance slab. Numerical demonstrations on synthetic and practical datasets demonstrate advantages over existing AMP-based, greedy, and reweighted-l(1) approaches.
引用
收藏
页码:3756 / 3760
页数:5
相关论文
共 32 条
[1]  
[Anonymous], 2007, IEEE J SEL TOPICS SI
[2]  
[Anonymous], IEEE T INFORM THEORY
[3]  
[Anonymous], P IEEE WORKSH COMP A
[4]  
[Anonymous], IEEE ICASSP IN PRESS
[5]  
[Anonymous], ARXIV12072456
[6]  
[Anonymous], 2010, P IEEE INF THEOR WOR
[7]  
[Anonymous], ARXIV13123968
[8]  
[Anonymous], ARXIV14083930V1
[9]  
[Anonymous], ARXIV150101797
[10]  
Bayati M., 2012, Proceedings of the 2012 IEEE International Symposium on Information Theory - ISIT, P1643, DOI 10.1109/ISIT.2012.6283554