Compressive Sampling via Random Convolution
暂无分享,去创建一个
Several recent results in compressive sampling show that a sparse signal (i.e. a signal which can be compressed in a known orthobasis) can be efficiently acquired by taking linear measurements against random test functions. In this paper, we show that these results can be extended to measurements taken by convolving with a random pulse and then subsampling. The measurement scheme is universal in that it complements (with high probability) any fixed orthobasis we use to represent the signal. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)
[1] David L Donoho,et al. Compressed sensing , 2006, IEEE Transactions on Information Theory.
[2] E. Candès,et al. Sparsity and incoherence in compressive sampling , 2006, math/0611957.
[3] Emmanuel J. Candès,et al. Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.
[4] E. Candès,et al. Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.