Minimax risk for Poisson compressed sensing

نویسندگان

  • Rebecca Willett
  • Maxim Raginsky
چکیده

This paper describes performance bounds for compressed sensing in the presence of Poisson noise and shows that, for sparse or compressible signals, they are within a log factor of known lower bounds on the risk. The signal-independent and bounded noise models used in the literature to analyze the performance of compressed sensing do not accurately model the effects of Poisson noise. However, Poisson noise is an appropriate noise model for a variety of applications, including low-light imaging, in which sensing hardware is large or expensive and limiting the number of measurements collected is important. In this paper, we describe how a feasible sensing matrix can be constructed and prove a concentration-of-measure inequality for these matrices. We then show that minimizing an objective function consisting of a negative Poisson log likelihood term and a penalty term which could be used as a measure of signal sparsity results in near-minimax rates of error decay.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Bounds for Compressed Sensing with Poisson Noise

This paper describes performance bounds for compressed sensing in the presence of Poisson noise when the underlying signal is sparse or compressible (admits a sparse approximation) in some basis. The signal-independent and bounded noise models used in the literature to analyze the performance of compressed sensing do not accurately model the effects of Poisson noise. However, Poisson noise is a...

متن کامل

Estimating Unknown Sparsity in Compressed Sensing

In the theory of compressed sensing (CS), the sparsity ‖x‖0 of the unknown signal x ∈ R is commonly assumed to be a known parameter. However, it is typically unknown in practice. Due to the fact that many aspects of CS depend on knowing ‖x‖0, it is important to estimate this parameter in a data-driven way. A second practical concern is that ‖x‖0 is a highly unstable function of x. In particular...

متن کامل

Reconstruction Error Bounds for Compressed Sensing under Poisson Noise using the Square Root of the Jensen-Shannon Divergence

Reconstruction error bounds in compressed sensing under Gaussian or uniform bounded noise do not translate easily to the case of Poisson noise. Reasons for this include the signal dependent nature of Poisson noise, and also the fact that the negative log likelihood in case of a Poisson distribution (which is directly related to the generalized Kullback-Leibler divergence) is not a metric and do...

متن کامل

Frames for compressed sensing using coherence

We give some new results on sparse signal recovery in the presence of noise, for weighted spaces. Traditionally, were used dictionaries that have the norm equal to 1, but, for random dictionaries this condition is rarely satised. Moreover, we give better estimations then the ones given recently by Cai, Wang and Xu.

متن کامل

Supporting Information to: Message Passing Algorithms for Compressed Sensing

This document presents details concerning analytical derivations and numerical experiments that support the claims made in the main text ‘Message Passing Algorithms for Compressed Sensing’, submitted for publication in the Proceedings of the National Academy of Sciences, USA. Hereafter ’main text’. One can find here: • Derivations of explicit Formulas for the MSE Map, and the optimal thresholds...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0901.1900  شماره 

صفحات  -

تاریخ انتشار 2009