Compressive sampling (CS), also called compressed sensing, entails making observations of an unknown signal by projecting it onto random vectors. Recent theoretical results show that if the signal is sparse (or nearly sparse) in some basis, then with high probability such observations essentially encode the salient information in the signal. Further, the signal can be reconstructed from these "random projections," even when the number of observations is far less than the ambient signal dimension. The provable success of CS for signal reconstruction motivates the study of its potential in other applications. This paper investigates the utility of CS projection observations for signal classification (more specifically, m-ary hypothesis testing). Theoretical error bounds are derived and verified with several simulations.
|Title of host publication||Proceedings 40th Asilomar Conference on Signals, Systems and Computers (ACSSC'06, Pacific Grove CA, USA, October 29-November 6, 2006)|
|Publisher||Institute of Electrical and Electronics Engineers|
|Publication status||Published - 2006|