Journal article

Compressed Sensing With Prior Information: Information-Theoretic Limits and Practical Decoders

Jonathan Scarlett, Jamie S Evans, Subhrakanti Dey

IEEE TRANSACTIONS ON SIGNAL PROCESSING | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | Published : 2013

Abstract

This paper considers the problem of sparse signal recovery when the decoder has prior information on the sparsity pattern of the data. The data vector {\bf x}=[x{1},\ldots,x{N}]T has a randomly generated sparsity pattern, where the i-th entry is non-zero with probability pi. Given knowledge of these probabilities, the decoder attempts to recover based on M random noisy projections. Information-theoretic limits on the number of measurements needed to recover the support set of perfectly are given, and it is shown that significantly fewer measurements can be used if the prior distribution is sufficiently non-uniform. Furthermore, extensions of Basis Pursuit, LASSO, and Orthogonal Matching Purs..

View full abstract

University of Melbourne Researchers