中文摘要：

将亚高斯随机投影引入可压缩传感CS（compressedsensing）理论，给出了两种新类型的CS测量矩阵：稀疏投影矩阵和非常稀疏投影矩阵．利用亚高斯分布尾部的有界性，证明了这两种矩阵满足CS测量矩阵的必要条件．同时，进一步说明由于这两种矩阵构成元素的稀疏性可以简化图像重建过程中的投影计算，从而提高重建速度．实验结果表明新的测量矩阵均有较好的测量效果，在满足一定测量数目要求的条件下可以精确重建．最后给出了这两种矩阵与一般采用的高斯测量矩阵的重建结果比较和分析．

英文摘要：

In this paper, sub-Gaussian random projection is introduced into compressed sensing （CS） theory and two new kinds of CS measurement matrix, sparse projection matrix and very sparse projection matrix are presented. By the tail bounds for sub-Gaussian random projections, the proof of how these new matrices satisfy the necessary condition for CS measurement matrix is provided. Then, it is expatiated that owing to their sparseness, new kinds of matrices greatly simplify the projection operation during image reconstruction, which simultaneously greatly improves the speed of reconstruction. Further, it can be easily proved that Gaussian matrix and Bernoulli matrix are special matrices obeying sub-Gaussian random distribution, which indicates that new measurement matrices extend the current results on CS measurement matrix. Both the results of simulated and real experiments show that with a certain number of measurements, new matrices have good measurement effect and can acquire exact reconstruction. Finally, the comparison and analysis of reconstruction results respectively adopting new matrices and Gaussian measurement matrix is conducted. Compared with Gaussian measurement matrix, new matrices have lesser average over-sampling factor, which indicates lower complexity of reconstruction.