Abstract: Recent results in compressive sampling have shown that sparse signals can be recovered from a small number of random measurements. This property raises the question of whether random measurements can provide an efficient representation of sparse signals in an information-theoretic sense. Through both theoretical and experimental results, we show that encoding a sparse signal through simple scalar quantization of random measurements incurs a significant penalty relative to direct or adaptive encoding of the sparse signal. Information theory provides alternative quantization strategies, but they come at the cost of much greater estimation complexity.
Publication Year: 2008
Publication Date: 2008-03-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 259
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot