Compressed Sensing Performance Bounds Under Poisson Noise
نویسندگان
چکیده
منابع مشابه
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...
متن کاملReconstruction Error Bounds for Compressed Sensing under Poisson or Poisson-Gaussian Noise Using Variance Stabilization Transforms
Most existing bounds for signal reconstruction from compressive measurements make the assumption of additive signal-independent noise. However in many compressive imaging systems, the noise statistics are more accurately represented by Poisson or Poisson-Gaussian noise models. In this paper, we derive upper bounds for signal reconstruction error from compressive measurements which are corrupted...
متن کامل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...
متن کاملPoisson Compressed Sensing
Compressed sensing has profound implications for the design of new imaging and network systems, particularly when physical and economic limitations require that these systems be as small and inexpensive as possible. However, several aspects of compressed sensing theory are inapplicable to real-world systems in which noise is signal-dependent and unbounded. In this work we discuss some of the ke...
متن کاملLearning and 1-bit Compressed Sensing under Asymmetric Noise
We study the approximate recovery problem under noise: Given corrupted 1-bit measurements of the form sign(w∗ · xi), recover a vector w with a small 0/1 loss w.r.t. w∗ ∈ R. In learning theory, this is known as the problem of learning halfspaces with noise, and in signal processing, as 1bit compressed sensing, in which there is an additional assumption that w∗ is t-sparse. Direct formulations of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2010
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2010.2049997