会议专题

Compressed Sensing and Reconstruction with Bernoulli Matrices

Compressed sensing seeks to recover a sparse or compressible signal from a small number of linear and nonadaptive measurements. While most of the studies so far focus on the prominent Gaussian random measurements, we investigate the performances of matrices with Bernoulli distribution. As extensions of symmetric signs ensemble, random binary ensemble and semi-Hadamard ensemble are proposed as sensing matrices with simplex structures. Based on some results of symmetric signs ensemble and the concept of compressed sensing matrices, we obtain a theoretical result that signal compressed sensing using random binary matrices can be exactly reconstructed with high probability. In reconstruction processes, the fast and lowconsumed orthogonal matching pursuit is adopted. Numerical results show that such matrices perform equally well to the Gaussian matrices.

compressed sensing Bernoulli matrices random binary ensemble semi-Hadamard ensemble orthogonal matching pursuit

Gesen Zhang Shuhong Jiao Xiaoli Xu Lan Wang

Information and Communication Engineering College Harbin Engineering University Harbin,Heilongjiang Department of Mathematics Beijing Institute of Technology Beijing,China

国际会议

2010 IEEE信息与自动化国际会议(ICIA 2010)

哈尔滨

英文

1-6

2010-06-20(万方平台首次上网日期,不代表论文的发表时间)