Performance bounds on compressed sensing with Poisson noise
| dc.creator | Willett, Rebecca M. | |
| dc.creator | Raginsky, Maxim | |
| dc.date | 2009-01-13 | |
| dc.date | 2009-04-30 | |
| dc.date.accessioned | 2026-07-07T13:09:46Z | |
| dc.date.available | 2026-07-07T13:09:46Z | |
| dc.description | This paper describes performance bounds for compressed sensing in the presence of Poisson noise when the underlying signal, a vector of Poisson intensities, is sparse or compressible (admits a sparse approximation). 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, where sensing hardware is large or expensive, and limiting the number of measurements collected is important. In this paper, we describe how a feasible positivity-preserving sensing matrix can be constructed, and then analyze the performance of a compressed sensing reconstruction approach for Poisson data that minimizes 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. | |
| dc.description | 5 pages; to appear in Proc. ISIT 2009 | |
| dc.identifier | https://arxiv.org/abs/0901.1900 | |
| dc.identifier | http://arxiv.org/abs/0901.1900 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/228844 | |
| dc.subject | Information Theory | |
| dc.title | Performance bounds on compressed sensing with Poisson noise | |
| dc.type | text |